#include <fstream>
#include <vector>
#include <deque>

using namespace std;

const int inf = 1e9;
const int NMAX = 1e5 + 10;
vector < int > v[NMAX];
int dist[NMAX];

int main() {	
	ifstream f("bfs.in");
	ofstream g("bfs.out");

	int n, m, s;
	f >> n >> m >> s;
	for (int i = 1; i <= m; i++) {
		int x, y;
		f >> x >> y;
		v[x].push_back(y);
	}
	f.close();

	for (int i = 1; i <= n; i++)
		dist[i] = inf;
	dist[s] = 0;
	
	deque < int > q;
	q.push_back(s);
	while (!q.empty()) {
		int node = q.front();
		q.pop_front();

		for (auto it : v[node])
			if (dist[it] == inf) {
				dist[it] = dist[node] + 1;
				q.push_back(it);
			}
	}

	for (int i = 1; i <= n; i++)
		if (dist[i] == inf)
			g << -1 << " ";
		else
			g << dist[i] << " ";
	g.close();

	return 0;
}