# include <cstdio>
# include <vector>
# include <cstring>
using namespace std;
#  define nmax 100001
int N,M,L;
vector<int>A[nmax];
int Cost[nmax],S[nmax],G[nmax];
void bfs(int Start)
{
	int i,j;
	memset(Cost,-1,sizeof(Cost));
	L=1;Cost[Start]=0;S[L]=Start;
	for(i=1;i<=L;++i)
		for(j=0;j<G[S[i]];++j)//cat timp n-am vizitat toti vecini nodului
			if(Cost[A[S[i]][j]]==-1)//daca vecini nodului S[i] nu au fost vizitati
			{
				S[++L]=A[S[i]][j];
				Cost[S[L]]=Cost[S[i]]+1;
			}
}
int main()
{
	FILE *f=freopen("bfs.in","r",stdin),*g=freopen("bfs.out","w",stdout);
	int S,i,j;
	scanf("%d%d%d",&N,&M,&S);
	while(M--)
	{
		scanf("%d%d",&i,&j);
		A[i].push_back(j);
	}
	for(i=1;i<=N;++i)
		G[i]=A[i].size();
	bfs(S);
	for(i=1;i<=N;++i)
		printf("%d ",Cost[i]);
}