#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
using namespace std;

const int nmax = 100001;

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

int n, m, x, y,sursa, d[nmax];
vector<int> ad[nmax];
queue<int> q;

void bfs(int source)
{
	d[source] = 1;
	q.push(source);
	while (!q.empty())
	{
		x = q.front();
		q.pop();
		for (int i = 0; i < ad[x].size(); i++)
		{
			if (!d[ad[x][i]])
			{
				q.push(ad[x][i]);
				d[ad[x][i]] = d[x] + 1;
			}
		}
	}
	for (int i = 1; i <= n; i++)
	{
		fout << d[x] - 1 << ' ';
	}
}

int main()
{
	fin >> n >> m>>sursa;
	for (int i = 1; i <= m; i++)
	{
		fin >> x >> y;
		ad[x].push_back(y);
	}
	bfs(sursa);
}