#include<bits/stdc++.h>
using namespace std;
 
int s,n,m,x,y,k;
int rs[100010];
bool viz[100010];
vector <int> v[100010];
queue <int> q;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

void bfs()
{
	q.push(s);
	viz[s] = 1;
	rs[s]=1;
	while(!q.empty()) 
	{
		int s= q.front();
		q.pop();
		for (int i=0; i<v[s].size();i++)
		{
		  if(!viz[v[s][i]]) q.push(v[s][i]), viz[v[s][i]]=1, rs[v[s][i]]=rs[s]+1;	
		}
	}
}
int main(){
	fin>>n>>m>>s;
    for (int i=1;i<=m;i++){
		fin>>x>>y;
        v[x].push_back(y);
	}
	bfs();
	for(int i=1;i<=n;i++){
		fout << rs[i] - 1 << " ";
	}
	return 0;
	
}