#include<stdio.h>
#include<vector>
using namespace std;
#define MAXN 100100
vector <int> nr[MAXN];
int cost[MAXN],grad[MAXN],coada[MAXN];
int n,m,start;
void bfs(){
	int i,j,ul;
	for(i=0;i<=n;++i)
		cost[i]=-1;
	coada[1]=start;
	cost[start]=0;
	ul=1;
	for(i=1;i<=ul;++i){
		for(j=0;j<grad[coada[i]];++j){
			if(cost[nr[coada[i]][j]]==-1){
				coada[++ul]=nr[coada[i]][j];
				cost[coada[ul]]=cost[coada[i]]+1;
			}
		}
	}
}
int main(){
	freopen("bfs.in", "r", stdin);
	freopen("bfs.out", "w", stdout);
	int x,y,i;
	scanf("%d%d%d",&n,&m,&start);
	for(i=0;i<m;++i){
		scanf("%d%d",&x,&y);
		nr[x].push_back(y);
		++grad[x];
	}
	
	bfs();
	for(i=1;i<=n;++i)
		printf("%d ",cost[i]);
	printf("\n");
	fclose(stdin);
	fclose(stdout);
	return 0;
}