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

FILE *f = freopen("bfs.in", "r", stdin);
FILE *g = freopen("bfs.out", "w", stdout);

const int N_MAX = 100010;

vector <int>  G[N_MAX];
int d[N_MAX];
bool inQueue[N_MAX];
queue <int> q;

int n, m, s;

void read(){
    scanf("%d %d %d", &n, &m, &s);

    for (int i=1; i<=m; i++){
        int x, y;

        scanf("%d %d", &x, &y);

        G[x].push_back(y);
    }
}

void solve(){
    q.push(s);
    for (int i=1; i<=n; i++)
        d[i] = 1e9;

    d[s] = 0;

    while (!q.empty()){
        int nod = q.front();
        q.pop();
        inQueue[nod] = false;

        for (int vecin : G[nod]){
            if (d[vecin] > d[nod] + 1){
                d[vecin] = d[nod] + 1;
                q.push(vecin);
                inQueue[vecin] = true;
            }
        }
    }
}

void write(){
    for (int i=1; i<=n; i++){
        if (d[i] != 1e9)
            printf("%d ", d[i]);
        else
            printf("-1 ");
    }
}

int main(){
    read();
    solve();
    write();
    return 0;
}