#include<cstdio>
#include<vector>
#include<cstring>
using namespace std;
#define N 100002
vector< int > A[N];
int G[N],S[N],Cost[N];
void BFS(int rad)
{
	int l=1;
	//setam toate nodurile nevizitate
	memset(Cost, -1,sizeof(Cost));
	S[l]=rad;//introduc nodul de start in coada
	Cost[rad]=0;
	int i,j;
	for(i=1;i<=l;++i)//parcurg nodurile din coada si se scot
		 for(j=0;j<G[S[i]];++j) // Parcurg vecinii nodului ce urmeaza sa fie eliminat
			if(Cost[A[S[i]][j]]==-1)
			{//Adaug nodurile in coada si le calculez distanta
				S[++l]=A[S[i]][j];
				Cost[A[S[i]][j]]=Cost[S[i]]+1;
			}
	
}
int main()
{
	FILE *f=freopen("bfs.in","r",stdin),
	*g=freopen("bfs.out","w",stdout);
	int n,m,s;
	scanf("%d %d %d",&n,&m,&s);
	int i,j;
	//Citeste arcele sub forma de liste de vecini
	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]);
	printf("\n");
}