#include <stdio.h>
#include <vector>
#include <queue>
#define NMAX 100005
#define pb push_back
using namespace std;
int n,m,s,cost[NMAX];
vector <int> A[NMAX];
queue <int> Q;
void read()
{
	scanf("%d%d%d",&n,&m,&s);
	int i,x,y;
	for (i=1; i<=m; i++)
	{
		scanf("%d%d",&x,&y);
		A[x].pb(y); 
	}
}
void solve()
{
	Q.push(s); cost[s]=1;
	int i,nod,vec;
	while (!Q.empty())
	{
		nod=Q.front();
		Q.pop();
		for (i=0; i<A[nod].size(); i++)
		{
			vec=A[nod][i];
			if (!cost[vec])
				Q.push(vec),cost[vec]=cost[nod]+1;
		}
	}
	for (i=1; i<=n; i++)
		if (!cost[i])
			printf("-1 ");
		else
			printf("%d ",cost[i]-1);
	printf("\n");
}
int main()
{
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	read();
	solve();
	return 0;
}