#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
int m,x,y,s,i,n,b[100002];
vector < int > h[100002];
queue < int > cc;
int main()
{
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
scanf("%d",&n);
scanf("%d",&m);
scanf("%d",&s);
for(i=1;i<=m;i++)
{
	scanf("%d",&x);
	scanf("%d",&y);
	h[x].push_back(y);
}
for(i=1;i<=n;i++)
	b[i]=-1;
cc.push(s);
b[s]=0;
while(!cc.empty())
{
	x=cc.front();
	for(i=0;i<h[x].size();i++)
		if(b[h[x][i]]==-1)
		{
			b[h[x][i]]=b[x]+1;
			cc.push(h[x][i]);
		}
	cc.pop();
}
for(i=1;i<=n;i++)
	printf("%d ",b[i]);
return 0;
}