#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
vector <int> v[100001];
queue <int> Q;
int viz[100001];
int n,m,s;
void BFS(){
	int x,i;
	viz[s]=1;
	Q.push(s);
	while(!Q.empty()){
		x=Q.front();
		for(i=0;i<v[x].size();i++){
			if(!viz[v[x][i]])
				Q.push(v[x][i]),viz[v[x][i]]=viz[x]+1;
		}
		Q.pop();
	}
}
int main(){
	int i,x,y;
	freopen("bfs.in","r",stdin);
	scanf("%d%d%d",&n,&m,&s);
	for(i=1;i<=m;i++){
		scanf("%d%d",&x,&y);
		v[x].push_back(y);
	}
	fclose(stdin);
	BFS();
	freopen("bfs.out","w",stdout);
	for(i=1;i<=n;i++)
		printf("%d ",viz[i]-1);
	fclose(stdout);
	return 0;
}