#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;

const int N = 100000;

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

int n, m, x;
vector<vector<int>> G(N);

void citire()
{
	f >> n >> m >> x;

	for (int i = 0; i < m; i++)
	{
		int a, b;
		f >> a >> b;
		G[a].push_back(b);
	}

}


bool* viz = new bool[N];

void bfs(int sursa,vector<int> &D)
{
	D[sursa] = 0;
	queue<int> q;
	q.push(sursa);
	viz[sursa] = 1;
	
	while (!q.empty())
	{
		int nod = q.front();
		for (auto i : G[nod])
		{
			if (!viz[i])
			{
				D[i] = D[nod] + 1;
				q.push(i);
				viz[i] = 1;
			}
		}
		q.pop();
	}
}

int main()
{
	citire();
	vector<int>D(n + 1, -1);
	bfs(x,D);

	for (int i = 1; i <= n; i++)
		g << D[i] << " ";




	return 0;
}