#include <fstream>
#include <vector>
#include <queue>
 
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector < int> vec[100001];
queue < int> que;
int viz[100001];
int dist[100001];
int main()
{
	int n,m,i,x,y,s;
	cin>>n>>m>>s;
 
	for(i=0;i<m;i++){
		cin>>x>>y;
		vec[x].push_back(y);
	}
	que.push(s);
	viz[s]=1;
	while(!que.empty()){
		int nr=que.front();
		que.pop();
		for(i=0;i<vec[nr].size();i++){
			int vecin=vec[nr][i];
			if(viz[vecin]==0){
				dist[vecin]=dist[nr]+1;
				viz[vecin]=1;
				que.push(vec[nr][i]);
			}
		}
	}
	for(i=1;i<=n;i++){
		if(viz[i]==0)
			cout<<-1<<" ";
		else
			cout<<dist[i]<<" ";
	}
	return 0;
}