#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define lim 100005

using namespace std;

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

int N, M, S;
int distanta[lim];

vector <int> muchia[lim];
queue <int> coada;

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

int main()
{
	f >> N >> M >> S;
	for (int i = 1; i <= M; i++)
	{
		int x, y;
		f >> x >> y;
		muchia[x].push_back(y);
	}
	for (int i = 1; i <= N; i++)
		distanta[i] = -1;
	distanta[S] = 0;

	coada.push(S);

	BFS();

	for (int i = 1; i <= N; i++)
		g << distanta[i] << " ";

	return 0;
}