#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector<int> G[100005];
queue<int> q;

int n, m, s, cost[100005];

int main()
{
	f >> n >> m >> s;
	int x, y;
	for (int i = 1; i <= m; i++)
	{
		f >> x >> y;
		G[x].push_back(y);
	}
	q.push(s);
	cost[s] = 1;
	while (!q.empty())
	{
		int c = q.front();
		q.pop();
		for (auto it : G[c])
			if (cost[it] == 0)
			{
				q.push(it);
				cost[it] = cost[c] + 1;
			}
	}
	for (int i = 1; i <= n; i++)
		g << cost[i] - 1 << " ";
	return 0;
}