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