#include <fstream>
#include <vector>
#include <queue>
#include <cstring>

using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");

queue<int> q;
vector<int> graph[100005];

int dst[100005];
int n,m,s,x,y;

void BFS(int source) {
	int node;

	q.push(source);
	dst[source]=0;

	while(!q.empty()) {
		node=q.front();
	
		for (int i=0;i<graph[node].size();i++) {
			if (dst[graph[node][i]]==-1) {
				dst[graph[node][i]]=dst[node]+1;
				q.push(graph[node][i]);
			}
		}

		q.pop();
	}
 }

int main() {
	in>>n>>m>>s;
	for (int i=0;i<m;i++) {
		in>>x>>y;
		graph[x].push_back(y);
	}

	memset(dst,-1,sizeof(dst));
	BFS(s);

	for (int i=1;i<=n;i++)
		out<<dst[i]<<" ";

	return 0;
}