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

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

int n, m;
vector <int> L[nmax];
int viz[nmax];

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

int main()
{
	int  i, j, start;
	fin >> n >> m >> start;
	while (m--)
	{
		fin >> i >> j;
		L[i].push_back(j);
	}
	BFS(start);
	for (i = 1; i <= n; i++)
		fout << viz[i] - 1 << " ";
	fin.close();
	fout.close();
	return 0;
}