#include<fstream>
#include<queue>
#include<vector>
#include <cstring>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int nivel [100005];
int n, m, p, viz[100005];
vector <int> v[100005];
queue <int> q; 

int main(){
	f>>n>>m>>p;
	for(int i=1; i<=m; ++i){
		int x, y;
		f>>x>>y;
		v[x].push_back(y);
	}
	q.push(p);
	for (int i = 1; i <= n; ++i) nivel[i] = -1;
	viz[p]=1;
	while(!q.empty()){
		int a=q.front();
		q.pop(); 
		vector <int>::iterator it=v[a].begin(), sf=v[a].end();
		nivel[p] = 0;
		for(;it!=sf; ++it)
			if(!viz[*it])
				{
					viz[*it]=1; 
					q.push(*it);
					nivel[*it] = nivel[a]+1;
			}
	}
	for (int i = 1; i <= n; ++i) g << nivel[i] << ' ';
	return 0;
}