# include <cstdio>
# include <vector>
# include <cstring>
using namespace std;
# define nmax 100010
int N,M,START,S[nmax];//coada
vector<int>A[nmax];
int Cost[nmax],L,G[nmax];
void bfs(int x)
{
	memset(Cost,-1,sizeof(Cost));
	int i,j;
	L=1;//primul element din coada
	Cost[x]=0;
	S[L]=x;
	for(i=1;i<=L;++i)//scoatem nodul S[i] din coada
		for(j=0;j<G[S[i]];++j)//parcurgem toti vecinii
			if(Cost[A[S[i]][j]]==-1)//daca sunt nevizitati
			{
				S[++L]=A[S[i]][j];//adaugam in coada
				Cost[A[S[i]][j]]=Cost[S[i]]+1;
			}
}
int main()
{
	FILE *f=freopen("bfs.in","r",stdin),*g=freopen("bfs.out","w",stdout);
	scanf("%d%d%d",&N,&M,&START);
	int i,x,j;
	for(i=1;i<=M;++i)
	{
		scanf("%d%d",&x,&j);
		A[x].push_back(j);
	}
	for(i=1;i<=N;++i)
		G[i]=A[i].size();
	bfs(START);
	for(i=1;i<=N;++i)
		printf("%d ",Cost[i]);
}