#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <bitset>
#include <deque>


using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");


#define VERTECES 100001

vector<int> graph[VERTECES];
int dist[VERTECES];
deque<int> dq;


void bfs(int source, int vertices) {
	dist[source] = 0;
	dq.push_back(source);
	while (!dq.empty()) {
		int node = dq.front();
		dq.pop_front();
		for (int i = 1; i <= graph[node].size(); ++i) {
			int neigh = graph[node][i - 1];
			if (dist[neigh] > dist[node] + 1) {
				dist[neigh] = dist[node] + 1;
				dq.push_back(neigh);
			}
		}
	}
}

int main()
{
	int vertices, edges, source;
	f >> vertices >> edges >> source;
	int x, y;
	for (int i = 1; i <= edges; ++i) {
		f >> x >> y;
		graph[x].push_back(y);
	}
	for (int i = 1; i <= vertices; ++i) {
		dist[i] = INT32_MAX;
	}

	bfs(source, vertices);
	for (int i = 1; i <= vertices; ++i) {
		if (dist[i] == INT32_MAX) {
			g << "-1 ";
		}
		else {
			g << dist[i] << " ";
		}
	}

	f.close();
	g.close();
	return 0;
}