#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector<int> g[100005];
queue<int> q;
int v[100005];

void bfs(int crt)
{
	while (!q.empty())
	{
		int s = q.front();
		q.pop();
		for (int i = 0;i< g[s].size(); i++)
		{
			if (v[g[s][i]] != -1) continue;
			v[g[s][i]] = v[s] + 1;
			q.push(g[s][i]);

		}
		
	}
}

int main()
{
	int n, m, s;
	fin >> n >> m >> s;
	for (int i = 1; i <= m; i++)
	{
		int a, b;
		fin >> a >> b;
		g[a].push_back(b);
	}
	for (int i = 1; i <= n; i++)
	{
		v[i] = -1;
	}
	v[s] = 0;
	
	q.push(s);
	bfs(s);

	for (int i = 1; i <= n; i++)
	{
		fout << v[i]<< " ";
	}






}