#include<fstream>
#include<algorithm>
#include<vector>
#include<queue>
#define Inf 100001
using namespace std;
int n, m, i, j, start, x, y;
vector<int> v[100001];
vector<int> d(100001, Inf);
queue<int> C;

void bfs()
{
	d[start]=0;
	C.push(start);
	while(!C.empty())
	{
		x=C.front();
		C.pop();
		for(i=0;i<v[x].size();i++)
			if(d[v[x][i]]>d[x]+1)
			{
				d[v[x][i]]=d[x]+1;
				C.push(v[x][i]);
			}
	}
}

int main()
{
	freopen("bfs.in", "r", stdin);
	freopen("bfs.out", "w", stdout);
	scanf("%d%d%d", &n, &m, &start);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d", &x, &y);
		v[x].push_back(y);
	}
	bfs();
	for(i=1;i<=n;i++)
		if(d[i]!=Inf)
			printf("%d ", d[i]);
		else
			printf("-1 ");
	printf("\n");
	fclose(stdin);
	fclose(stdout);
	return 0;
}