#include <cstdio>
#include <vector>
using namespace std;

#define maxsize 100005

int n, m, s, x, y;
vector<int> gr[maxsize];
int c[maxsize], niv[maxsize];

void bfs(int a)
{
	int u;
	vector<int>::iterator it;

	for(int i = 0; i < maxsize; ++i)
		niv[i] = -1;

	int l = 1, k;
	c[l] = a;
	niv[a] = 0;
	
	for(int i = 1; i <= l; ++i)
	{
		u = c[i];
		for(it = gr[u].begin(); it != gr[u].end(); ++it)
		    if(niv[*it] == -1)
			{
				c[++l] = *it;
				niv[*it] = niv[u]+1;
			}
	}
}

int main()
{

	freopen("bfs.in", "r", stdin);
	freopen("bfs.out", "w", stdout);

	scanf("%d %d %d", &n, &m, &s);

	for(int i = 0; i < m; ++i)
	{
		scanf("%d %d", &x, &y);
        gr[x].push_back(y);
	}

	bfs(s);

	for(int i = 1; i <= n; ++i)
		printf("%d ", niv[i]);


	return 0;
}