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