#include<stdio.h>
#include<queue>
using namespace std;
queue <int> q;
queue <int> mat[100001];
bool viz[100001];
int t[100001];
int n,m,i,x,y,s;
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);
		mat[x].push(y);
	}
	for(i=1;i<=n;i++)
		t[i]=-1;
	viz[s]=1;
	q.push(s);
	t[s]=0;
	while(!q.empty())
	{
		x=q.front();
		while(mat[x].size())
		{
			y=mat[x].front();
			if(viz[y]==0)
			{
				viz[y]=1;
				t[y]=t[x]+1;
				q.push(y);
			}
			mat[x].pop();
		}
		q.pop();
	}
	for(i=1;i<=n;i++)
		printf("%d ",t[i]);
	return 0;
}