#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int nmax=1000000;
int n,m,ns,dis[nmax];
vector <int> muchi[nmax];

queue <int> coada;
void bfs(){
	int nod,vecin;
	while(!coada.empty()){
		nod= coada.front();
		coada.pop();
		for(unsigned int i=0;i<muchi[nod].size();i++){
			vecin = muchi[nod][i];
			if(dis[vecin] ==-1){
				coada.push(vecin);
				dis[vecin]=dis[nod]+1;
				
			}
		}
		
	}
}
int main(){

in >>n>>m>>ns;
for(int i=1;i<=m;i++){
	int x,y;
	in >>x>>y;
	muchi[x].push_back(y);	
}
for(int i=1;i<=n;i++){
	dis[i]=-1;
}
dis[ns]=0;
coada.push(ns);
bfs();
for(int i=1;i<=n;i++){
	out <<dis[i]<<" ";
}
}