#include<stdio.h>
#include<queue>
#include<vector>

using namespace std;

int m,n,s,d[100001];
const int N=1<<17;
vector<int> a[N]; 
queue<int> q;

void citire()
{
	int x,y,i;
	scanf("%d %d %d",&n,&m,&s);
	for(i=1;i<=m;i++)
	{
		scanf("%d %d",&x,&y);
		a[x].push_back(y);
	}
}

int main()
{
	int x,y,i;
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	citire();
	
	q.push(s);
	for(i=1;i<=n;i++)
		d[i]=-1;
	d[s]=0;
	while(!q.empty())
	{
		x=q.front();
		//printf("%d ",x);
		q.pop();
		for(size_t i=0;i<a[x].size();i++)
		{
			y=a[x][i];
			if(d[y]==-1)
			{
				q.push(y);
				d[y]=1+d[x];
			}
		}
	}
	//printf("\n");
	for(i=1;i<=n;i++)
		printf("%d ",d[i]);
}