#include<cstdio>
#include<vector>
#include<queue>
using namespace std;

vector<int> a[100005];
queue<int> q;
bool marcat[100005];
int d[100005],i,x,n;

void bfs()
{
	while(!q.empty())
	{
		x=q.front();
		q.pop();
		for(size_t i=0;i<a[x].size();i++)
		{
			if(marcat[a[x][i]]==false)
			{
				q.push(a[x][i]);
				d[a[x][i]]=d[x]+1;
				marcat[a[x][i]]=true;
			}
		}
	}
	for(i=1;i<=n;i++)
		printf("%d ",d[i]);
	return ;
}

int main()
{
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	int m,s,y;
	scanf("%d%d%d",&n,&m,&s);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		a[x].push_back(y);
	}
	q.push(s);
	marcat[s]=true;
	for(i=1;i<=n;i++)
		d[i]=-1;
	d[s]=0;
	bfs();
	return 0;
}