#include<bits/stdc++.h>
using namespace std;

vector <int> v[100010];
queue <int> q;
bool viz[100010];
int rs[100010];
int n,m,x,y,k,s;

void bfs(int nod){
	q.push(s);
	viz[nod]=1;
	rs[nod] = 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(){
	ifstream cin("bfs.in");
	ofstream cout("bfs.out");
	cin>>n>>m>>s;
	for(int i=1;i<=m;i++){
		cin>>x>>y;
		v[x].push_back(y);
	}
	bfs(s);
	for(int i=1;i<=n;i++)
	cout<<rs[i]-1<<' ';
return 0;
}