#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

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

const int NMAX = 1e5;
vector<int> L[NMAX + 1];
int vis[NMAX + 1];
int d[NMAX + 1];
int n, m, s;


void bfs(int node) {
	queue<int> q;
	for (int i = 1; i <= n; i++) {
		d[i] = -1;
	}
	q.push(node);
	d[node] = 0;
	vis[node] = 1;
	while (!q.empty()) {
		int x = q.front();
		q.pop();
		for (auto next : L[x]) {
			if (!vis[next]) {
				d[next] = d[x] + 1;
				vis[next] = 1;
				q.push(next);
			}
		}
	}
}

int main()
{
	in >> n >> m >> s;
	for (int i = 1; i <= m; i++) {
		int x, y;
		in >> x >> y;
		L[x].push_back(y);
	}
	bfs(s);
	for (int i = 1; i <= n; i++) {
		out << d[i] << ' ';
	}
	return 0;
}