#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

int main()
{
	int N, M, S;
	in >> N >> M >> S;
	S--;
	vector<vector<int>> G(N, vector<int>());
	for (int i = 0; i < M; i++)
	{
		int u, v;
		in >> u >> v;
		u--; v--;
		G[u].push_back(v);
	}
	vector<int> dist(N, -1);
	queue<int> q;
	q.push(S);
	dist[S] = 0;

	while (!q.empty())
	{
		int node = q.front();
		q.pop();

		for (auto it = G[node].begin(); it != G[node].end(); it++)
		{
			if (dist[*it] < 0)
			{
				dist[*it] = dist[node] + 1;
				q.push(*it);
			}
		}
	}
	for (int i = 0; i < N; i++)
	{
		out << dist[i] << ' ';
	}
}