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

using namespace std;

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

int N, M;
int S;
vector<int> g[100005];
vector<int> d(100005, -1);

void citire()
{
	in >> N >> M >> S;
	int x, y;

	for (int i{ 0 }; i < M; ++i) {
		in >> x >> y;
		g[x].push_back(y);
	}

}

void BFS()
{
	queue<int> q;
	d[S] = 0;
	for (q.push(S); !q.empty(); q.pop()) {
		int c = q.front();

		for (auto& i : g[c]) {
			if (d[i] == -1) {
				q.push(i);
				d[i] = d[c] + 1;
			}
		}
	}
}

void afisare()
{
	for (int i{ 1 }; i <= N; ++i)
		out << d[i] << ' ';
}

int main()
{
	citire();
	BFS();
	afisare();
}