#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];


void inFu(void)
{
	int a, b;
	FILE *f = fopen("bfs.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 BFS(void)
{
	vector<int>::iterator i;
	memset(d, -1, sizeof(d));
	d[S] = 0;
	q.push(S);
	
	while(!q.empty())
	{
		int nod = q.front();
		q.pop();
		
		for(i = v[nod].begin(); i != v[nod].end(); ++i)
			if(d[*i] == -1)
				q.push(*i),			
				d[*i] = d[nod] + 1;					
			
	}
}

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