#include <bits/stdc++.h>

using namespace std;

const int NMAX = 123000;
const int INF = numeric_limits<int>::max();

int n, m, source;
vector<int> adj[NMAX];
queue<int> neighbors;
bool visited[NMAX];
int dist[NMAX];


int main() {
	freopen("bfs.in", "r", stdin);
	freopen("bfs.out", "w", stdout);
	cin >> n >> m >> source;
	for (int i = 0; i < m; i++) {
		int x, y;
		cin >> x >> y;
		adj[x].push_back(y);
	}
	for (int i = 0; i < NMAX; i++) {
		visited[i] = false;
		dist[i] = INF;
	}
	visited[source] = true;
	dist[source] = 0;
	neighbors.push(source);
	while (!neighbors.empty()) {
		int u = neighbors.front();
		neighbors.pop();
		for (int v : adj[u]) {
			if (!visited[v]) {
				visited[v] = true;
				dist[v] = dist[u] + 1;
				neighbors.push(v);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		if (dist[i] == INF) cout << -1;
		else cout << dist[i];
		cout << " ";
	}
	cout << endl;
	return 0;
}