#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
#define max 100010

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

int n, m, S;
vector<int> adj[max];
int dist[max];
queue <int> q;

void bfs() {
	int node, neighbor;
	
	while (!q.empty()) {
		node = q.front();
		q.pop();
		for (int i = 0; i < adj[node].size(); ++i) {
			neighbor = adj[node][i];
			if (dist[neighbor] == -1) {
				q.push(neighbor);
				dist[neighbor] = dist[node] + 1;
			}
		}
	}
}


int main() {
	fin >> n >> m >> S;
	for (int i = 1; i <= m; ++i) {
		int x, y;
		fin >> x >> y;
		adj[x].push_back(y);
	}
	for (int i = 1; i <= n; ++i) {
		dist[i] = -1;
	}
	dist[S] = 0;
	q.push(S);
	bfs();
	for (int i = 1; i <= n; ++i) {
		fout << dist[i] << ' ';
	}

	return 0;
}