#include <stdio.h>
#include <vector>
#include <queue>
#define NMax 100010
using namespace std;

const char IN[]="bfs.in",OUT[]="bfs.out";

int N,M,X;
int T[NMax];
queue<int> qu;
vector<int> ad[NMax];

int main()
{
	int i,x,y;
	freopen(IN,"r",stdin);
	scanf("%d%d%d",&N,&M,&X);
	while (M--)
	{
		scanf("%d%d",&x,&y);
		ad[x].push_back(y);
	}

	T[X]=1;qu.push(X);
	while (!qu.empty())
	{
		x=qu.front();qu.pop();
		//fprintf(stderr,"%d\n",x);
		for (i=0;i<(int)ad[x].size();++i) if (!T[ad[x][i]])
			T[ad[x][i]]=T[x]+1,
			qu.push(ad[x][i]);
	}

	freopen(OUT,"w",stdout);
	for (i=1;i<=N;++i) printf("%d ",T[i]-1);
	printf("\n");

	return 0;
}