#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define lim 100004
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
queue <int > chiu;
vector <int> much[lim];
int n,m,s,x,y;
int viz[lim];
int main()
{
	f>>n>>m>>s;
	for (int i=1;i<=m;i++)
	{
		f>>x>>y;
		much[x].push_back(y);
	}
	chiu.push(s);
	while (!chiu.empty())
	{
		int nod=chiu.front();
		chiu.pop();
		for (int i=0;i<much[nod].size();i++)
		{
			if (viz[much[nod][i]]==0 && much[nod][i]!=s)
			{
				viz[much[nod][i]]=viz[nod]+1;
				chiu.push(much[nod][i]);
			}
		}
	}
	for (int i=1;i<=n;i++)
	{
		if (viz[i]==0 && i!=s) g<<-1<<" ";
		else g<<viz[i]<<" "; 
	}
	f.close();
	g.close();
	return 0;
}