#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

int n, m, s;
vector<int> e[100100];
int c[100100];
bool viz[100100];

void bfs(int x) {
    queue<int> q;
    q.push(x);
    viz[x] = true;
    for (int i = 1; i <= n; ++i) c[i] = -1;
    c[x] = 0;
    while (!q.empty()) {
        x = q.front();
        q.pop();
        for (auto y : e[x]) {
            if (!viz[y]) {
                viz[y] = true;
                c[y] = c[x] + 1;
                q.push(y);
            }
        }
    }
}

int main() {
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    int x, y;

    scanf("%d %d %d", &n, &m, &s);
    for (int i = 0; i < m; ++i) {
        scanf("%d %d", &x, &y);
        e[x].push_back(y);
    }
    bfs(s);
    for (int i = 1; i <= n; ++i) printf("%d ", c[i]);

    return 0;
}