#include<bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s, dp[100005];
vector<int> mt[100005];
queue<int> q;
void BFS()
{
	while (!q.empty())
	{
		int nod = q.front();
		q.pop();
		for (auto i : mt[nod])
		{
			if (dp[i] > dp[nod] + 1)
				dp[i] = dp[nod] + 1, q.push(i);
		}
	}
}
int main()
{
	fin >> n >> m >> s;
	for (int i = 1; i <= n; ++i)
		dp[i] = (1 << 20);
	dp[s] = 0;
	q.push(s);
	for (int i = 1; i <= m; ++i)
	{
		int x, y;
		fin >> x >> y;
		mt[x].push_back(y);
	}
	BFS();
	for (int i = 1; i <= n; ++i)
	{
		if (dp[i] == (1 << 20))
			fout << -1 << " ";
		else fout << dp[i] << " ";
	}
}