#include<cstring>
#include<cstdio>
#include<queue>
#include<vector>
#define pb push_back

using namespace std;

queue <int>q;
vector <int>L[100001];
int x,s,n,m,i,t[100001],y;
bool viz[100001];

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);
		L[x].pb(y);
	}
	memset(viz,false,sizeof(viz));
	viz[s]=true;
	q.push(s);
	t[s]=0;
	while (!q.empty())
	{
		x=q.front();
		viz[x]=true;
		for (i=0;i<L[x].size();i++)
		{
			if (viz[L[x][i]]==false)
			{
				q.push(L[x][i]);
				t[L[x][i]]=t[x]+1;
			}
		}
		q.pop();
	}
	for (i=1;i<=n;i++)
	{
		if (t[i]==0&&i!=s)
			printf("-1 ");
		else if (t[i]==0)
			printf("0 ");
		else 
			printf("%d ",t[i]);
	}
	return 0;
}