#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
vector<int> legaturi[100002];
queue<int> coada;
int n,m,s,viz[100002],lungime_drum[100002];
void bfs(int x){
	coada.push(x);
	viz[x]=1;
	while(!coada.empty()){
		for(int it=0;it<legaturi[coada.front()].size();it++)
			if(!viz[legaturi[coada.front()][it]]){
				viz[legaturi[coada.front()][it]]=1;
				coada.push(legaturi[coada.front()][it]);
				lungime_drum[legaturi[coada.front()][it]]=lungime_drum[coada.front()]+1;
			}
		coada.pop();
	}
	
}


int main(){
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	scanf("%d%d%d",&n,&m,&s);
	int x,y;
	for(int i=1;i<=m;i++){
		scanf("%d%d",&x,&y);
		legaturi[x].push_back(y);
	}
	bfs(s);
	for(int i=1;i<=n;i++){
		if(!viz[i])
			printf("-1 ");
		else
			printf("%d ",lungime_drum[i]);
	}
	return 0;
}