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


void BFS(vector<vector<int>> &matrice, vector<int> &lungime)
{
	while (!coada.empty())
	{
		int Nod_curent, Nod_vecin;
		Nod_curent = coada.front();
		coada.pop();
		for (int i = 0; i < matrice[Nod_curent].size(); i++)
		{
			Nod_vecin = matrice[Nod_curent][i];
			if (lungime[Nod_vecin] == -1)
			{
				coada.push(Nod_vecin);
				lungime[Nod_vecin] = lungime[Nod_curent] + 1;
			}
		}
	}
}
int main()
{
	int n, m, s;
	f >> n >> m >> s;
	vector<vector<int>> matrice(n+1);
	vector<int> lungime(n+1, -1);
	for (int i = 0; i < m; i++)
	{
		int x, y;
		f >> x >> y;
		matrice[x].push_back(y);
	}
	lungime[s] = 0;
	coada.push(s);
	BFS(matrice,lungime);
	for (int i = 1; i <= n; i++)
		g << lungime[i] << " ";
	return 0;
}