#include <cstdio>
#include <list>
#include <queue>
#include <vector>
using namespace std;
#define pb push_back
const int MAXN = 100010;

int n;
vector< list<int> > vecini;
vector<int> dist;
vector<bool> sel;
queue<int> c;

void read();
void bfs();
void write();

int main()
{
	read();
	bfs();
	write();
	return 0;
}

void bfs()
{
	int i;
	list<int>::iterator it, sfarsit;
	for (; !c.empty(); c.pop())
	{
		i = c.front();
		sfarsit = vecini[i].end();
		for (it = vecini[i].begin(); it != sfarsit; ++it)
		{
			if (!sel[*it])
			{
				sel[*it] = 1;
				dist[*it] = dist[i] + 1;
				c.push(*it);
			}
		}
	}
}

void write()
{
	int i;
	FILE *fout = fopen("bfs.out", "w");
	for (i = 1; i <= n; ++i)
	{
		fprintf(fout, "%d ", dist[i]);
	}
	fprintf(fout, "\n");
	fclose(fout);
}

void read()
{
	int i, m, s, x, y;
	FILE *fin = fopen("bfs.in", "r");
	fscanf(fin, "%d%d%d", &n, &m, &s);
	vecini.resize(n + 1);
	dist.resize(n + 1, -1);
	sel.resize(n + 1, 0);
	for (i = 1; i <= m; ++i)
	{
		fscanf(fin, "%d%d", &x, &y);
		vecini[x].pb(y);
	}
	fclose(fin);
	c.push(s);
	dist[s] = 0;
	sel[s] = 1;
}