#include<bits/stdc++.h>
using namespace std;
#define Nica 100005
int n,m,x,y,s;
vector <int> v[Nica];
bool viz[Nica];
queue <int> q;
int rs[Nica];
void bfs(int nod){
	q.push(nod);
	viz[nod]=1;
	rs[nod]=1;
	while(!q.empty()){
		int nod=q.front();
		q.pop();
		for(int i=0;i<v[nod].size();i++)
		    if(!viz[v[nod][i]])q.push(v[nod][i]),viz[v[nod][i]]=1,rs[v[nod][i]]=rs[nod]+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;
}