#include<fstream>
#include<vector>
#include<cstring>
#include<queue>
#define NMAX 100001
using namespace std;

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

void BFS(int n, vector<int>G[], int nod, int dist[]) {
	dist[nod] = 0;
	queue <int> q;
	q.push(nod);
	while (!q.empty()) {
		int x = q.front();
		for (int i = 0; i < G[x].size(); ++i) {
			if (dist[G[x][i]] == -1 || dist[G[x][i]] > dist[x] + 1) {
				dist[G[x][i]] = dist[x] + 1;
				q.push(G[x][i]);
			}
		}
		q.pop();
	}

}

int main()
{
	int n, m, x, y, nod, dist[NMAX];
	vector<int>G[NMAX];
	f >> n >> m >> nod;
	for (int i = 0; i < m; ++i) {
		f >> x >> y;
		G[x].push_back(y);
	}
	memset(dist, -1, sizeof(dist));
	BFS(n, G, nod, dist);
	for (int i = 1; i <= n; ++i) {
		g << dist[i] <<" ";
	}
}