#include <bits/stdc++.h>

__attribute__((always_inline)) size_t get_int()
{
    static char inBuffer[0x20000];

    static size_t p = 0x1FFFF; size_t number = 0x0;

    inBuffer[p] > 0x2F || ++p != 0x20000 || (fread(inBuffer, 0x1, 0x20000, stdin), p = 0x0);

    for(; inBuffer[p] > 0x2F;)
    {
        number = number * 0xA + inBuffer[p] - 0x30;

        ++p != 0x20000 || (fread(inBuffer, 0x1, 0x20000, stdin), p = 0x0);
    }

    return number;
}

char outBuffer[20000000]; unsigned int p = ~0x0;

__attribute__((always_inline)) void put_int(unsigned int x)
{
    if(x < 0)
    {
        outBuffer[++p] = 45; outBuffer[++p] = 49; outBuffer[++p] = 32;

        return;
    }

    unsigned int digits = x > 0x3B9AC9FF ? 0xB :
                          x > 0x5F5E0FF  ? 0xA :
                          x > 0x98967F   ? 0x9 :
                          x > 0xF423F    ? 0x8 :
                          x > 0x1869F    ? 0x7 :
                          x > 0x270F     ? 0x6 :
                          x > 0x3E7      ? 0x5 :
                          x > 0x63       ? 0x4 :
                          x > 0x9        ? 0x3 : 0x2;

    for(unsigned int i = digits; --i; x /= 0xA)
    {
        outBuffer[p + i] = x % 0xA + 0x30;
    }

    outBuffer[p = p + digits] = 0x20;
}

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 = get_int(), M = get_int(), start = get_int();

    for(int i = 0; i < M; ++i)
    {
        ++degree[get_int()];

        get_int();
    }

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

    degree[N + 1] = M;

    get_int(), get_int(), get_int();

    for(int i = 0; i < M; ++i)
    {
        int u = get_int(), v = get_int();

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

    BFS(start);

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

    ///fwrite(outBuffer, 1, p, stdout);

    return 0;
}