#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <fstream>
using namespace std;
#define inf 0xfffffff
#define MOD 1999999973

vector<int> gr[100010];
queue<int> q;
int n, m, d[100010];

void bfs(int s) {
	int x, y;
	d[s] = 1;
	q.push(s);
	while (q.size()) {
		x = q.front();
		q.pop();
		for (int i = 0; i < gr[x].size(); i++) {
			y = gr[x][i];
			if (!d[y]) {
				d[y] = d[x] + 1;
				q.push(y);
			}
		}
	}
}

int main() {
	int s, x, y;
	
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	
	scanf("%d %d %d", &n, &m, &s);
	for (int i = 1; i <= m; i++) {
		scanf("%d %d", &x, &y);
		gr[x].push_back(y);
	}
	bfs(s);
	for (int i = 1; i <= n; i++) {
		printf("%d ", d[i]-1);
	}

	return 0;
}