#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

const int NMAX = 100505;

int N, M, source;
vector<int> graph[NMAX];

void read() {
	scanf("%d%d%d", &N, &M, &source);
	int x, y;
	for (int edgeIdx = 0; edgeIdx < M; edgeIdx++) {
		scanf("%d%d", &x, &y);
		graph[x].push_back(y);
	}
}

void bfs(int source) {
	vector<int> D(N + 1, N);
	queue<int> queue;
	D[source] = 0;
	queue.push(source);

	while (!queue.empty()) {
		int node = queue.front();
		queue.pop();

		for (auto neighbour : graph[node]) {
			if (D[neighbour] > D[node] + 1) {
				D[neighbour] = D[node] + 1;
				queue.push(neighbour);
			}
		}
	}

	for (int i = 1; i <= N; i++) {
		if (D[i] == N) {
			printf("-1 ");
		} else {
			printf("%d ", D[i]);
		}
	}
	printf("\n");
}

int main() {
	freopen("bfs.in", "r", stdin);
	// froepen("bfs.out", "w", stdout);

	read();
	bfs(source);
	return 0;
}