#include <deque>
#include <iostream>
#include <vector>

int main(void) {

#ifndef LOCAL
	freopen("bfs.in", "r", stdin);
	freopen("bfs.out", "w", stdout);
#endif

	int n, m, s;

	std::cin >> n >> m >> s;

	std::vector<std::vector<int>> adj(n + 1);

	for (int i = 0; i < m; ++i) {
		int x, y;

		std::cin >> x >> y;

		adj[x].push_back(y);
	}

	std::deque<int> q;
	std::vector<bool> vis(n + 1, false);
	std::vector<int> dist(n + 1, -1);

	q.push_back(s);
	vis[s] = true;
	dist[s] = 0;

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

		for (int neigh : adj[node]) {
			if (!vis[neigh]) {
				vis[neigh] = true;
				dist[neigh] = dist[node] + 1;
				q.push_back(neigh);
			}
		}
	}

	for (int i = 1; i <= n; ++i) {
		std::cout << dist[i] << " ";
	}
	std::cout << "\n";

	return 0;
}