#include <stdio.h>
#include <vector>
#define maxn 100010

using namespace std;

int nums[maxn], n, m, s, x, y;
vector<vector<int> > adiacente(100001);
vector<bool> parcurs(100001, false);
vector<int> sol;

void bfs(int nod, int level) {
	parcurs[nod] = true;
	sol[nod] = level;

	for (int i = 0; i < adiacente[nod].size(); i ++)
		 if (!parcurs[adiacente[nod][i]])
		 	bfs(adiacente[nod][i], level + 1);
}

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(s, 0);

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

	return 0;
}