#include <iostream>
#include <fstream>
#include <queue>
#include <list>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define NMAX 100005

using namespace std;

void bfs(vector<int> lg[], int node, int n, FILE *out) {
    queue<int> q;
    int i, dist[NMAX], pp, p;
    memset(dist, 0, NMAX);
    dist[node] = 0;
	q.push(node);

    while (!q.empty()) {
       	pp = q.front();
        for (i = 0; i < lg[pp].size(); i++) {
        	p = lg[pp][i];
            if (dist[p] == 0 && p != node) {
                dist[p] = dist[pp] + 1;
                q.push(p);
            }
        }
        q.pop();
    }

    for (i = 1; i <= n; i++) {
    	if (!dist[i] && i != node) {
    		fprintf(out, "-1 ");
    	} else {
    		fprintf(out, "%d ", dist[i]);
    	}
    }

}

int main() {
	FILE *in = fopen("bfs.in", "rt"), *out = fopen("bfs.out", "wt");
	int n, m, i, x, y, src;
	vector<int> lg[NMAX];

	fscanf(in, "%d%d%d", &n, &m, &src);

	for (i = 0; i < m; ++i) {
        fscanf(in, "%d%d", &x, &y);
        lg[x].push_back(y);
    }
    
    bfs(lg, src, n, out);

    fclose(in);
    fclose(out);
}