#include <fstream>
#include<iostream>
#include<vector>
#include<queue>

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

int const LIM = 10005;
int distanta[LIM];
vector <int> muchii[LIM];
int N, M;
int nod_start;
 queue <int>  coada;

void BFS() {
	int nod, vecin;
	while (!coada.empty()) {
		nod = coada.front();
		coada.pop();
		for (unsigned int i = 0; i < muchii[nod].size(); i++) {
			vecin = muchii[nod][i];
			if (distanta[vecin] == -1) {
				coada.push(vecin);
				distanta[vecin] = distanta[nod] + 1;
			}
		}
	}
}

void citire() {
	cin >> N >> M >> nod_start;
	for (int i = 1; i <= M; i++) {
		int x, y;
		cin >> x >> y;
		muchii[x].push_back(y);
	}
	for (int i = 1; i <= N; i++) 
		distanta[i] = -1;
		distanta[nod_start] = 0;
		coada.push(nod_start); 
		     BFS(); 
		for (int i = 1; i <= N; i++) {
			cout << distanta[i] << " "; 
		}
	}

 
int main() {
	citire();
	return 0;
}