#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int NMAX = 1e5;
int costuri[NMAX];
vector<int> coada;

int n, m,t;
struct muchie {
	int start, end;
};
vector<muchie> graf;

void citire() {
	f >> n >> m >> t;
	for (int i = 0; i < m; i++) {
		muchie m;
		f >> m.start >> m.end;
		graf.push_back(m);
	}
}
void afisare() {
	for (int i = 1; i <= n; i++) {
		g << costuri[i] << " ";
	}
}
void bfs(int start) {
	coada.push_back(start);
	for (int i = 1; i <= n; i++)costuri[i] = -1;
	costuri[start] = 0;
	while (!coada.empty()) {
		int cur = coada.front();
		coada.erase(coada.begin());
		for (muchie e : graf) {
			if (e.start == cur)
			{
				if (costuri[e.end] == -1)
				{
					coada.push_back(e.end);
					costuri[e.end] = costuri[e.start]+1;
				}

			}
		}
	}
}
int main()
{
	citire();
	bfs(t);
	afisare();

}