#include<iostream>
#include<fstream>
#include<vector>

#define nm 100005

using namespace std;

int n;

vector <int> v[nm];

ifstream f("bfs.in");
ofstream g("bfs.out");

void bfs(int s)
{
	int nod,c[nm],viz[nm],p=0,u=0;
	for(int i=1;i<=n;++i)
		viz[i]=0;
	c[0]=s;
	viz[s]=1;
	while(p<=u)
	{
		nod=c[p++];
		for(int i=0;i<v[nod].size();++i)
			if(viz[v[nod][i]]!=1)
			{
				viz[v[nod][i]]=viz[nod]+1;
				c[++u]=v[nod][i];
			}
	}
	for(int i=1;i<=n;++i)
		g<<viz[i]-1<<' ';
	/*if(u==n-1)
		cout<<"g e conex"<<'\n';
	else
		cout<<"g nu e conex"<<'\n';*/
}

int main()
{
	int m,s;
	int x,y;
	f>>n>>m>>s;
	while(f>>x>>y)
		v[x].push_back(y);
	bfs(s);
}