#include <bits/stdc++.h>

using namespace std;
int N,M,dp[1000010];
vector<int> V[1000010];
bool viz[1000010];
void bfs(int x){
	dp[x] = 0;
	queue<int> Q;
	Q.push(x);
	while (!Q.empty()){
		int nod = Q.front();
		Q.pop();
		viz[nod] = 1;
		for (int i = 0; i < V[nod].size(); i++){
			int it = V[nod][i];
			if (!viz[it]){
				dp[it] = dp[nod] + 1;
				Q.push(it);
			}
		}
	}
	
}

int main(){
	ifstream fin("bfs.in");
	ofstream fout("bfs.out");
	int x;
	fin >>N>>M>>x;	
	for(int a,b;M--;){
		fin >> a >> b;
		V[a].push_back(b);
	}
	bfs(x);
	for (int i = 1; i <= N;i++)
	{
		if (!viz[i]) fout<<-1<<" ";
		fout <<dp[i]<<" ";
	}
	return 0;
}