#include <bits/stdc++.h>

using namespace std;

vector <int> graph[100005];
int distances[100005];

void bfs(int source, int n) {
	queue <int> q;
	for (int i = 1; i <= n; ++i) {
		distances[i] = n + 1; // INF
	}
	distances[source] = 0;
	q.push(source);

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

		for (auto x : graph[node]) {
			if (distances[x] > distances[node] + 1) {
				distances[x] = distances[node] + 1;
				q.push(x);
			}
		}
	}
}

int main() {
	freopen("bfs.in", "r", stdin);
	freopen("bfs.out", "w", stdout);
	int n, m, s;
	cin >> n >> m >> s;

	for (int i = 1; i <= m; ++i) {
		int x, y;
		cin >> x >> y;
		graph[x].push_back(y);
	}

	bfs(s, n);

	for (int i = 1; i <= n; ++i) {
		if (distances[i] == n + 1) {
			distances[i] = -1;
		}
		cout << distances[i] << " ";
	}
	return 0;
}