#include <cstdio>
#include <vector>

using namespace std;

#define file_in "bfs.in"
#define file_out "bfs.out"

#define Nmax 101000

int n,m,s,p,u,i,d[Nmax],q[Nmax],nod,a,b;
vector<int> G[Nmax];

int main()
{
	freopen(file_in,"r",stdin);
	freopen(file_out,"w",stdout);
	
	scanf("%d %d %d", &n, &m,&s);
	
	while(m--)
	{
		scanf("%d %d", &a, &b);
		
		G[a].push_back(b);
		//G[b].push_back(a);
	}
	
	
	memset(d,-1,sizeof(d));
	
	d[s]=0;
	q[1]=s;
	p=u=1;
	
	while(p<=u)
	{
		nod=q[p++];
		
		for (i=0;i<G[nod].size();++i)
			 if (d[G[nod][i]]==-1)
			 {
				 d[G[nod][i]]=d[nod]+1;
				 q[++u]=G[nod][i];
			 }
	}
	
	for (i=1;i<=n;++i)
		  printf("%d ", d[i]);
	
	fclose(stdin);
	fclose(stdout);
	
	return 0;
	
}