#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
using namespace std;

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

int d[100001];
vector<int> l[100001];
queue<int> q;
int n, m;


void bfs(int start) {
	for (int i = 1; i <= n; i++)
		d[i] = -1;

	d[start] = 0;
	q.push(start);
	while (!q.empty()) {
		int nod = q.front();
		q.pop();
		for (auto vecin : l[nod]) {
			if (d[vecin] == -1) {
				d[vecin] = d[nod] + 1;
				q.push(vecin);
			}
		}
	}
	for (int i = 1; i <= n; i++)
		fout << d[i] << " ";
}

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