#include <bits/stdc++.h>
#include <fstream>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector<int> adiacenta[100010];
int nrArce[100010], i;
bool vizitat[100010];

void bfs(int s) {
	queue<int> coada;

	coada.push(s);
	vizitat[s] = true;
	nrArce[s] = 0;
	while(!coada.empty()) {
		int nod_curent = coada.front();
		coada.pop();
		for (int vecin:adiacenta[nod_curent]) {
			if (!vizitat[vecin])
			{
				coada.push(vecin);
				vizitat[vecin] = true;
				nrArce[vecin] = nrArce[nod_curent] + 1;
			}
		}
	}
}

int main()
{
	int n, m, s, x, y;
	fin >> n >> m >> s;

	for (i = 0; i < m; i++)
	{
		fin >> x >> y;
		adiacenta[x].push_back(y);
	}

	for (i = 1; i <= n; i++)
		nrArce[i] = -1;

	bfs(s);

	for (i = 1; i <= n; i++)
		fout << nrArce[i] << " ";
	return 0;
}