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

using namespace std;

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

void bfs(int node, vector<vector<int>>& edges, vector<bool>& viz, queue<int> q, vector<int>& dist) {
	//cerr << node + 1 << endl;
	viz[node] = true;

	int child_dist = dist[node] + 1;

	for (int i = 0; i < edges[node].size(); i++) {
		int copil = edges[node][i];
		if (!viz[copil]) {
			dist[copil] = child_dist;
			q.push(copil);
		}
	}
	if (!q.empty()) {
		int next = q.front();
		q.pop();
		bfs(next, edges, viz, q, dist);
	}
}

int main() {

	int n, m, s;
	fin >> n >> m >> s; s--;

	vector<vector<int>> edges(n);
	for (int i = 0; i < m; i++) {
		int a, b;
		fin >> a >> b; a--; b--;

		edges[a].push_back(b);
	}

	queue<int> q;
	vector<bool> viz(n);
	vector<int> dist(n);
	bfs(s, edges, viz, q, dist);

	for (int i = 0; i < n; i++) {
		if (i != s && dist[i] == 0) 
			dist[i] = -1;
		fout << dist[i] << " ";
	}
	fout << "\n";

	
	return 0;
}