#include<fstream>
#include<vector>
#include<queue>
using namespace std;

vector <int> a[100001];
queue <int> c;
int d[100001],n,m,k,i,x,y;

int main()
{
	ifstream f("bfs.in");
	ofstream g("bfs.out");
	f >> n >> m >> k;
	for (i=1;i<=m;i++)
	{
		f >> x >> y;
		a[x].push_back(y);
	}
	d[k]=1;
	c.push(k);
	while (!c.empty())
	{
		x=c.front();
		for (i=0;i<a[x].size();i++)
			if (d[a[x][i]]==0)
			{
				d[a[x][i]]=d[x]+1;
				c.push(a[x][i]);
			}
		c.pop();
	}
	for (i=1;i<=n;i++)
		g << d[i]-1 << ' ';
	return 0;
}