#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
int viz[100000],d[100000];
using namespace std;
int main()
{ifstream f("bfs.in");
ofstream h("bfs.out");
int n,m,s,x,y,xx,i;
vector< vector<int> > v(100000);
queue<int> q;
f>>n>>m>>s;
for(i=1;i<=m;i++)
{f>>x>>y;
v[x].push_back(y);}
	
q.push(s);
while(!q.empty())
{xx=q.front();
q.pop();
viz[xx]=1;
for(i=0;i<v[xx].size();i++)
	if(viz[v[xx][i]]==0)
	{viz[v[xx][i]]=1;
	d[v[xx][i]]=d[xx]+1;
	q.push(v[xx][i]);}}

for(i=1;i<=n;i++)
if(d[i]==0&&i!=s)
h<<"-1 ";
else		
h<<d[i]<<" ";	
return 0;}