#include <stdio.h>
#include <vector>
#include <deque>

using namespace std;

int n, m, s, x, y, nod;
vector<vector<int> > adiacente(100001);
vector<int> sol;
deque<int> Q;

void bfs() {
	sol[s] = 0;
	Q.push_back(s);

	while (!Q.empty()) {
		nod = Q.front();
		Q.pop_front();

		for (int i = 0; i < adiacente[nod].size(); i ++)
			if (sol[adiacente[nod][i]] == -1) {
				sol[adiacente[nod][i]] = sol[nod] + 1;
				Q.push_back(adiacente[nod][i]);
			}
	}
}

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

	scanf("%d %d %d", &n, &m, &s);	 

	for (int i = 1; i <= m; i ++) {
		scanf("%d %d", &x, &y);
		adiacente[x].push_back(y);
	}     

	for (int i = 0; i <= n; i ++)
		sol.push_back(-1);
	bfs();

	for (int i = 1; i <= n; i ++)
		printf("%d ", sol[i]);

	return 0;
}