#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#define NMAX 100010
using namespace std;

vector<int> v[NMAX];
queue<int> q;
int N, M, S, i, j, d[NMAX], c[NMAX];


void inFu(void)
{
	int a, b;
	FILE *f = fopen("dfs.in", "r");
	fscanf(f, "%d%d%d", &N, &M, &S);
	for(i = 1; i <= M; ++i)
		fscanf(f, "%d%d", &a, &b),
		v[a].push_back(b);
	fclose(f);
}
void DFS(void)
{
	for(i = 1; i <= N; ++i)
		d[i] = -1;
	d[S] = 0;
	q.push(S);
	//c[1] = S;
	//int prim = 1, ultim = 1, nod;
	while(!q.empty())
	{
		int nod = q.front();
		q.pop();
		//nod = c[prim++];
		for(i = 0; i < v[nod].size(); i++)
			if(d[v[nod][i]] == -1 || d[nod] + 1 < d[v[nod][i]])
			{
				q.push(v[nod][i]);
				//++ultim;
				//c[++ultim] = v[nod][i];
				d[v[nod][i]] = d[nod] + 1;					
			}
	}
}

void outFu(void)
{
	FILE *g = fopen("dfs.out", "w");
	for(i = 1; i <= N; ++i)
		fprintf(g ,"%d ", d[i]);
	
	fclose(g);
}
int main(void)
{
	inFu();
	DFS();
	outFu();
	
	return 0;
}