#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>

FILE *fin = fopen("dfs.in", "r");
FILE *fout = fopen("dfs.out", "w");

#define MAXN 100000

std::vector <int> v[MAXN + 1];
bool viz[MAXN + 1];
int q[MAXN + 1];
int st =  0;
int dr = 0;
int dist[MAXN + 1];

inline void add(int p) {
    dr++;
    q[dr] = p;
}
inline void del() {
    st++;
}

void bfs(int a) {
    add(a);
    while (st <= dr) {
        int s = v[q[st]].size();
        for (int i = 0; i < s; i++) {
            if (viz[v[q[st]][i]] == 0) {
                add(v[q[st]][i]);
                dist[v[q[st]][i]] = dist[q[st]] + 1;
            }
        }
        del();
    }
}

void dfs(int i) {
    viz[i] = 1;
    int k = v[i].size();
    for (int j = 0; j < k; j++)
        if (viz[v[i][j]] == 0)
            dfs(v[i][j]);
}

int main()
{
    int m, n, nr = 0, x, y, s;
    fscanf(fin, "%d%d%d", &n, &m, &s);
    for (int i = 1; i <= m; i++) {
        fscanf(fin, "%d%d", &x, &y);
        v[x].push_back(y);
    }
    bfs(s);
    for (int i = 1; i <= n; i++) {
        if (dist[i] != 0 && i != s)
            fprintf(fout, "%d", dist[i]);
        else if (i == s)
            fprintf(fout, "0");
        else
            fprintf(fout, "-1");
        fprintf(fout, " ");
    }
    return 0;
}