#include <fstream>
#include <vector>
#include <queue>
std::ifstream fin("bfs.in");
std::ofstream fout("bfs.out");
int n, m;
const int NLIM = 101;
std::vector<int> V[NLIM];
std::queue<int>Q;
int distanta[NLIM];
void BFS() {
	int nod, vecin;
	while (!Q.empty()) {
		nod = Q.front();
		Q.pop();
		for (unsigned int i = 0; i < V[nod].size(); ++i) {
			vecin = V[nod][i];
			//fout << vecin << " ";
			if (distanta[vecin] == -1) {
				Q.push(vecin);
				distanta[vecin] = distanta[nod] + 1;
			}
		}
	}
}
void citire() {
	int nod_start;
	fin >> n >> m >> nod_start;
	for (int i = 1; i <= m; ++i) {
		int x, y; 
		fin >> x >> y;
		V[x].push_back(y);
	}
	for (int i = 1; i <= n; ++i)
		distanta[i] = -1;
	distanta[nod_start] = 0;
	Q.push(nod_start);
	BFS();
	for (int i = 1; i <= n; i++)
		fout << distanta[i] << " ";
}
int main() {
	citire();
	return 0;
}