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

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

int N, M, S;
int Distanta[NLIM];

vector <int> Muchii[NLIM];
queue <int> Coada;

void BFS(int s)
{
	for (int i = 1; i <= N; i++)
		if (i != s)
			Distanta[i] = -1;
	Distanta[s] = 0;
	Coada.push(s);
	while (!Coada.empty())
	{
		int u = Coada.front();
		Coada.pop();
		for (unsigned int y = 0; y < Muchii[u].size(); y++)
		{
			int vecin = Muchii[u][y];
			if (Distanta[vecin] == -1) {
				Distanta[vecin] = Distanta[u] + 1;
				Coada.push(vecin);
			}
		}
	}
}

void Citire()
{
	int x, y;
	fin >> N >> M >> S;
	for (int i = 1; i <= M; i++)
	{
		fin >> x >> y;
		Muchii[x].push_back(y);
	}
	BFS(S);
	for (int i = 1; i <= N; i++)
		fout << Distanta[i] << " ";

}

int main()
{
	Citire();
	return 0;
}