#include <bits/stdc++.h>

using namespace std;

void bfs(int s, vector<vector<int>> &adj, vector<int> &dist)
{
	queue<int> q;
	q.push(s);
	dist[s] = 0;
	while (!q.empty()) {
		int next = q.front();
		q.pop();
		for (int i : adj[next])
			if (dist[i] == -1) {
				q.push(i);
				dist[i] = dist[next] + 1;
			}
	}
}

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

	vector<vector<int>> adj(n + 3, vector<int>());

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

	vector<int> dist(n + 3, -1);

	bfs(s, adj, dist);

	for (int i = 1; i <= n; ++i)
		cout << dist[i] << ' ';
	return 0;
}