#include <bits/stdc++.h>
#define MAXN 100010
using namespace std;

int V[MAXN],n,m,s;
vector <int> A[MAXN];

void BFS(int node){
	queue <int> q;
	q.push(node);
	V[node]=0;
	while(!q.empty()){
		int c=q.front();
		for(int i=0;i<A[c].size();i++){
			if(V[A[c][i]]==-1){
				V[A[c][i]]=V[c]+1;
				q.push(A[c][i]);
			}
		}
		q.pop();
	}
}

int main(){
	ifstream cin("bfs.in");
	ofstream cout("bfs.out");
	cin>>n>>m>>s;
	for(int i=0;i<=n;i++)V[i]=-1;
	for(int i=0;i<m;i++){
		int a,b;
		cin>>a>>b;
		A[a].push_back(b);
	}
	BFS(s);
	for(int i=1;i<=n;i++)cout<<V[i]<<' ';
}