#include <bits/stdc++.h>
using namespace std;

int f[100005];

deque<int>dq;

vector<int> stk[100005];

void bfs(int n) {
    f[n] = 0;
    dq.push_back(n);
    while (dq.size()) {
        int q = dq.front();
        for (auto v:stk[q]) {
            if (f[v] == 0 && v != n) {
                f[v] = f[q] + 1;
                dq.push_back(v); } }
        dq.pop_front(); } }

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

    bfs(s);

    for (int  i = 1; i <= n; i++) {
        if (i == s)
            printf("0 ");
        else
            if (f[i] == 0)
                printf("-1 ");
            else
                printf("%d ", f[i]); }
    printf("\n");
    return 0; }