#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int n, m,s;
vector<int> G[100005];
int viz[100005];
queue<int> q;

void bfs()
{
	int nodCurent;
	viz[s] = 1;
	q.push(s);
	while (!q.empty())
	{
		nodCurent = q.front();
		q.pop();
		for (int i = 0; i < G[nodCurent].size(); i++)
		{
			if (viz[G[nodCurent][i]] == 0)
			{
				viz[G[nodCurent][i]] = viz[nodCurent]+1;
				q.push(G[nodCurent][i]);
			}
		}
	}
}
int main()
{
	f >> n >> m >> s;
	for (int i = 1; i <= m; i++)
	{
		int x,y;
		f >> x >> y;
		G[x].push_back(y);
	}
	bfs();
	for (int i = 1; i <= n; i++)
	{
		g << viz[i] - 1 <<  ' ';
	}
}