#include <iostream>
#include <stdio.h>
#include <queue>
#include <vector>
using namespace std;
vector<int> l[100000 + 100];
int visited[100000 + 100],N,M,S;
void add(int i,int j){
	if(i != j){
		l[i].push_back(j);
	}
}
void bfs(int start){
	queue<int> q;
	q.push(start);
	visited[start] = 0;
	while(q.size() > 0){
		int node = q.front();
		q.pop();
		vector<int> neighbours = l[node];
		for(int i = 0; i < neighbours.size(); i++){
			if(visited[neighbours[i]] == -1){
				visited[neighbours[i]] = visited[node] + 1;
				q.push(neighbours[i]);
			}
		}
	}
	for(int i = 1; i <= N; i++)
		printf("%d ",visited[i]);
}


int main(){
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	scanf("%d%d%d",&N,&M,&S);
	for(int i = 0; i < M; i++){
		int a,b;
		scanf("%d%d",&a,&b);
		add(a,b);
	}

	for(int i = 1; i <= N; i++)
		visited[i] = -1;
	bfs(S);

	return 0;
}