#include<stdio.h>
#include<vector>
using namespace std;
int N,M,i,S,x,y,nod;
vector<int> a[100001],sol(100001,-1),Q;
vector<int>::iterator it;
void BF()
{
	Q.push_back(S);
	sol[S]=0;
	i=0;
	while (i!=Q.size())
	{
		nod=Q[i];
		for (it=a[nod].begin();it!=a[nod].end();it++)
			if (sol[*it]==-1)
			{
				Q.push_back(*it);
				sol[*it]=sol[nod]+1;
			}
		i++;
	}
}
int main()
{
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);	
	scanf("%d%d%d",&N,&M,&S);
	for (i=1;i<=M;i++)
	{
		scanf("%d%d",&x,&y);
		a[x].push_back(y);
	}
	BF();
	for (i=1;i<=N;i++)
		printf("%d ",sol[i]);
}