#include<cstdio>
#include<vector>
#include<deque>
using namespace std;
vector<int> v[100010];
deque<int> Q;
int n,m,s,i,x,y,viz[100010];
void read(),solve();
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	int d;
	vector<int>::iterator it;
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	scanf("%d%d%d",&n,&m,&s);
	for(;m;m++)
	{
		scanf("%d%d",&x,&y);
		v[x].push_back(y);
	}
}
void solve()
{
	Q.push_back(s);viz[s]=1;
	for(;Q;size();)
	{
		x=Q.front();d=viz[x]+1;
		for(it=v[x].begin();it!=v[x].end();it++)
			if(!viz(*it))
			{
				viz[*it]=d;
				Q.push_back(*it);
			}
			Q.pop_front();
	}
	for(i=1;i<=n;i++)
		printf("%d ",viz[i]-1);
}