#include <fstream>
#include <vector>
#include <queue>
#define DIM 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, st, x, y, d[DIM];
vector<int> a[DIM];
queue<int> q;
int main() {
	fin >> n >> m >> st;
	while (m--) {
		fin >> x >> y;
		a[x].push_back(y);
	}
	for (int i = 1; i <= n; i++)
		d[i] = -1;
	d[st] = 0;
	q.push(st);
	while (!q.empty()) {
		int nod = q.front();
		q.pop();
		for (int i = 0; i < a[nod].size(); i++) {
			int vec = a[nod][i];
			if (d[vec] == -1) {
				d[vec] = d[nod] + 1;
				q.push(vec);
			}
		}
	}
	for (int i = 1; i <= n; i++)
		fout << d[i] << " ";
	return 0;
}