#include <bits/stdc++.h>

#define maxn 100010

using namespace std;

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

vector <int> A[maxn];

int N, M, L, Start;
int G[maxn], S[maxn], Cost[maxn];

void BFS(int nod)
{
	int i, j;

	memset(Cost, -1, sizeof(Cost));
	L = 1;
	Cost[nod] = 0;
	S[L] = nod;

	for (i = 1; i <= L; i++)
		for (j = 0; j < G[S[i]]; j++)
			if (Cost[A[S[i]][j]] == -1)
			{
				S[++L] = A[S[i]][j];
				Cost[S[L]] = Cost[S[i]] + 1;
			}
}

int main()
{
	int i, x, y;
	fin >> N >> M >> Start;
	for (i = 1; i <= M; i++)
	{
		fin >> x >> y;
		A[x].push_back(y);
	}

	for (i = 1; i <= N; i++)
		G[i] = A[i].size();

	BFS(Start);

	for (i = 1; i <= N; i++)
		fout << Cost[i] << " ";
	fout << "\n";

	return 0;
}