#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n, m, s, x, y;
int dist[100005];
vector <int> v[100005];
queue <int> q;

void bfs()
{
	q.push(s);
	dist[s] = 1;
	while (!q.empty())
	{
		for (auto i : v[q.front()])
		{
			if (dist[i] == 0)
			{
				dist[i] = dist[q.front()] + 1;
				q.push(i);
			}
		}
		q.pop();
	}
	for (int i = 1; i <= n; i++)
		g << dist[i] - 1 << " ";
}


int main()
{
	f >> n >> m >> s;
	for (int i = 1; i <= m; i++)
	{
		f >> x >> y;
		v[x].push_back(y);
	}
	bfs();
    return 0;
}