#include<iostream>
#include<fstream>
#include<stdio.h>
#include<queue>
#include<vector>
using namespace std;
int s,n,m,i,x,y;
queue <int> q;
vector <int> a[100000];
vector <int> mini;
vector <int> viz;
int parcurg()
{
	q.push(s);
	viz[s]=1;
	while(q.size()>0)
	{
	for(i=0;i<a[q.front()].size();i++)
		if(viz[a[q.front()][i]]==0)
		{
			q.push(a[q.front()][i]);
			viz[a[q.front()][i]]=1;
			mini[a[q.front()][i]]=mini[q.front()]+1;		
		}
	q.pop();
	}
}

int main()
{
	ifstream f("bfs.in");
	f>>n>>m>>s;
	for(i=0;i<m;i++)
	{	
		f>>x>>y;
		a[x].push_back(y);
	}
	viz.assign(100000,0);
	mini.assign(100000,0);
	parcurg();
	ofstream g("bfs.out");
for(i=1;i<=n;i++)
{
	if((mini[i]==0)&&(s!=i))
		g<<-1<<" ";
	else
		g<<mini[i]<<" ";
}
	return 0;
	g.close();
}