#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <set>
using namespace std;

unordered_map<int, set<int>> g;
unordered_map<int, int> distances;
queue<int> q;

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

	int n, m, s;
	in >> n >> m >> s;
	
	int a, b;
	for (int i = 0; i < m; ++i) {
		in >> a >> b;
		g[a].insert(b);
	}

	for (int i = 1; i <= n; ++i) {
		distances[i] = -1;
	}

	q.push(s);
	distances[s] = 0;
	while (!q.empty()) {
		int currentNode = q.front();
		q.pop();

		for (auto& n : g[currentNode]) {
			if (distances[n] == -1) {
				distances[n] = distances[currentNode] + 1;
				q.push(n);
			}
		}
	}

	for (int i = 1; i <= n; ++i) {
		out << distances[i] << ' ';
	}
}