#include<fstream>
#include<vector>
#include<queue>
#define inf 0x3f3f3f
using namespace std;
ifstream f("alee.in");
ofstream g("alee.out");
vector<vector<int> > a(500001);
vector<int> d(500001,inf);
queue<int> q;
void bfs(int x)
{
	int i;
	q.push(x);
	while(!q.empty())
	{
		x=q.front();
		q.pop();
		for(i=0;i<a[x].size();++i)
			if(d[a[x][i]]>d[x]+1)
				d[a[x][i]]=d[x]+1,q.push(a[x][i]);
	}
}
int i,j,n,m,x,ic,y;
int main()
{
	f>>n>>m;
	f>>ic;
	for(;m;--m)
	{
		f>>x>>y;
		a[x].push_back(y);
	}
	d[ic]=0;
	bfs(ic);
	for(i=1;i<=n;i++)
		if(d[i]==inf)
			g<<-1<<" ";
		else
			g<<d[i]<<" ";
		return 0;
}