#include <bits/stdc++.h>
#include <unordered_map>
#define nmax 100006
#define MOD 1999999973
#define INF 2012345678
#define ll long long
using namespace std;
//#define fin cin
//#define fout cout

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n, m;
vector <int> L[nmax];
bitset <nmax> viz;
queue <int> q;
int d[nmax];

void BFS(int k)
{
	for (int i = 1; i <= n; i++)
		d[i] = INF;
	q.push(k);
	d[k] = 0;
	viz[k] = 1;
	while (!q.empty())
	{
		k = q.front();
		q.pop();
		for (int i : L[k])
			if (viz[i] == 0)
			{
				viz[i] = 1;
				d[i] = d[k] + 1;
				q.push(i);
			}
	}
}

int main()
{
	int i, x, y, start;
	fin >> n >> m >> start;
	for (i = 1; i <= m; i++)
	{
		fin >> x >> y;
		L[x].push_back(y);
	}

	BFS(start);

	for (i = 1; i <= n; i++)
		if (d[i] != INF)
			fout << d[i] << " ";
		else
			fout << "-1 ";
	fout << "\n";
	fin.close();
	fout.close();
	return 0;
}