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

using namespace std;

int n, m, s;
vector <int> g[100001];

vector <int> bfs(int s) {
	vector <int> d(n + 1, -1);
	queue <int> q;

	d[s] = 0;
	q.push(s);

	while (!q.empty()) {
		int nod = q.front();
		q.pop();
		for (int i = 0; i < g[nod].size(); i++) {
			int vecin = g[nod][i];
			if (d[vecin] == -1) {
				d[vecin] = d[nod] + 1;
				q.push(vecin);
			}
		}
	}

	return d;
}

int main() {
	vector <int> sol;
	ifstream in;
	ofstream out;
	in.open("bfs.in");
	in >> n >> m >> s;
	int x, y;
	for (int i = 0; i < m; i++) {
		in >> x >> y;
		g[x].push_back(y);
	}
	sol = bfs(s);
	out.open("bfs.out");
	for (int i = 1; i <= n; i++)
		out << sol[i] << " ";
    return 0;
}