#include <bits/stdc++.h>

int muchii[1000010];
int degree[100010];
char level[100010];
int Q[100010], qs, qe;

void BFS(int s)
{
    memset(level, 0xFF, sizeof level);

    qs = qe = 0;

    level[s] = 0;

    Q[qe++] = s;

    while(qs < qe)
    {
        int t = Q[qs++];

        for(int it = degree[t], tar = degree[t + 1]; it != tar; ++it)
        {
            int v = muchii[it];

            if(level[v] >= 0) continue;

            level[v] = level[t] + 1;

            Q[qe++] = v;
        }
    }
}

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

    int N, M, start, u, v;

    scanf("%d %d %d", &N, &M, &start);

    for(int i = 0; i < M; ++i)
    {
        scanf("%d %d", &u, &v);

        ++degree[u];
    }

    for(int i = 1; i <= N; ++i)
    {
        degree[i] += degree[i - 1];
    }

    degree[N + 1] = M;

    freopen("bfs.in", "r", stdin);

    scanf("%d %d %d", &N, &M, &start);

    for(int i = 0; i < M; ++i)
    {
        scanf("%d %d", &u, &v);

        muchii[--degree[u]] = v;
    }

    BFS(start);

    for(int i = 1; i <= N; ++i)
    {
        printf("%d ", level[i]);
    }

    return 0;
}