#include <array>
#include <fstream>
#include <queue>
#include <vector>

std::array<std::vector<int>, 100010> edges;

std::vector<int> bfs (int start, int n) {
	std::queue<int> q;
	std::vector<int> result(n + 1, -1);

	result[start] = 0;
	q.emplace(start);

	while (!q.empty()) {
		auto node = q.front();
		q.pop();

		for (auto to: edges[node])
			if (result[to] == -1) {
				result[to] = result[node] + 1;
				q.emplace(to);
			}
	}

	return result;
}

int main () {
	std::ifstream in("bfs.in");
	in.exceptions(in.failbit);
	std::ofstream out("bfs.out");
	out.exceptions(out.failbit);

	int n, m, s;
	in >> n >> m >> s;

	for (int i = 0; i < m; ++ i) {
		int x, y;
		in >> x >> y;

		edges[x].emplace_back(y);
	}

	const auto result = bfs(s, n);
	
	for (int i = 1; i <= n; ++ i)
		out << result[i] << ' ';
	out << '\n';
}