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

using namespace std;

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

vector<vector<int>> edges;

vector<int> bfs(int start) {
	vector<int> dist(edges.size(), -1);
	queue<int> q;

	q.push(start);
	dist[start] = 0;
	while (!q.empty()) {
		int node = q.front();
		q.pop();

		for (int i = 0; i < edges[node].size(); i++) {
			int vecin = edges[node][i];
			if (dist[vecin] == -1) {
				dist[vecin] = dist[node] + 1;
				q.push(vecin);
			}
		}
	}

	return dist;
}

int main() {
	int n, m;
	fin >> n >> m;

	edges.resize(n);

	int s;
	fin >> s;

	for (int i = 0; i < m; i++) {
		int a, b;
		fin >> a >> b;
		edges[a-1].push_back(b-1);
	}

	vector<int> dist = bfs(s-1);

	for (int i = 0; i < n; i++) {
		fout << dist[i] << " ";
	}
	fout << "\n";

	return 0;
}