#include <fstream>
#include <vector>
#define NMAX 100010
using namespace std;

int N, M, L, Start;
vector <int> A[NMAX];
int G[NMAX], S[NMAX], C[NMAX];

void BFS(int nod)
{
	int i, j;
	for(i=0;i<=NMAX;i++) C[i]=-1;
	L = 1;
	C[nod] = 0;
	S[L] = nod;
	for(i=1;i<=L;i++)
	   for(j=0;j<G[S[i]];j++)
			if(C[A[S[i]][j]]==-1) S[++L] = A[S[i]][j], C[S[L]] = C[S[i]] + 1;
}	

int main()
{
    ifstream f ("bfs.in");
    ofstream g ("bfs.out");
	int i, x, y;
	f>>N>>M>>Start;
	for(i=1;i<=M;i++) f>>x>>y, A[x].push_back(y);
	for(i=1;i<=N;i++) G[i]=A[i].size();
	BFS(Start);
	for(i=1;i<=N;i++) g<<C[i]<<" ";
	f.close();
	g.close();
	return 0;
}