#include <iostream>
#include <vector>
#include <fstream>
#include <queue>

using namespace std;

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

const int nlim=100001;

short int distanta[nlim];
int n, m;

queue <unsigned int > coada;

vector <unsigned int> muchii[nlim];


void bfs ()
	{
		int nod, vecin;
		while (!coada.empty())
		{
			nod=coada.front();
			coada.pop();
			for (unsigned int i=0; i<muchii[nod].size(); i++)
				{
					vecin=muchii[nod][i];
					if (distanta[vecin]==-1)
						{
							coada.push(vecin);
							distanta[vecin]=distanta[nod]+1;
						}
				}
		}
	}
void citire()
{
	unsigned int x,y,nodstart;
	
	f>>n>>m>>nodstart;
	
	for (unsigned int i =1; i<=m; i++)
		{
			f>>x>>y;
			muchii[x].push_back(y);
		}
	for (unsigned int i=1; i<=n; i++)
		distanta[i]=-1;
	distanta[nodstart]=0;
		
	coada.push(nodstart);
	bfs();
	
	for (unsigned int i=1; i<=n; i++)
		g<<distanta[i]<<" ";
}
int main() 
{			
	citire();
	f.close();
	g.close();
	return 0;
}