#include <iostream>
#include <fstream>
#include <queue>
#include <memory.h>
#include <vector>
#include <list>
#include<stdio.h>
using namespace std;

const int maxn=100005;

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

int n, m, s, x, y;
int viz[maxn], drum[maxn];

vector <int> v[maxn];
queue <int> q; 

void bfs(int z){
	viz[z] = 1;
	q.push(z);
	while(q.size()){
		int p = q.front();
		for(int i = 0; i < v[p].size(); ++i){
		  int a = v[p][i];
			if(viz[a] == 0){
				drum[a] = drum[p] + 1;
				viz[a] = 1;
				q.push(a);
			}
		}
	 q.pop();	
	}
}

int main(){
	fin >> n >> m >> s;
	for(int i = 1; i <= m; ++i){
		fin >> x >> y;
		v[x].push_back(y);
	}
	bfs(s);
	for(int i = 1; i <= n; ++i){
		if(drum[i]==0 && i!=s)
			fout << -1 << " ";
		else 
			fout << drum[i] << " ";
	}
	
	return 0;
}