#include <stdio.h>
#include <string.h>
#pragma GCC optimize("O1")

int edge[1000010];

int degree[100010];

char level[100010];

int Q[100010], qStart, qEnd;

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

    qStart = qEnd = 0;

    level[start] = 0;

    Q[qEnd++] = start;

    while(qStart < qEnd)
    {
        int u = Q[qStart++];

        for(int it = degree[u], end = degree[u + 1]; it != end; ++it)
        {
            int v = edge[it];

            if(~level[v]) continue;

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

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

char buffer[20000000]; int p = -1;

__attribute__((always_inline)) int get_int()
{
    int number = 0;

    for(++p; buffer[p] > 47; ++p)
    {
        number = number * 10 + buffer[p] - 48;
    }

    return number;
}

__attribute__((always_inline)) void put_int(int x)
{
    if(x > 9)
    {
        buffer[++p] = x / 10 + 48;

        buffer[++p] = x % 10 + 48;
    }
    else if(x == -1)
    {
        buffer[++p] = 45;

        buffer[++p] = 49;
    }
    else
    {
        buffer[++p] = x + 48;
    }

    buffer[++p] = 32;
}

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

    fread(buffer, 1, 12500000, stdin);

    int N = get_int(), M = get_int(), start = get_int(), u, v;

    for(int i = M + 1; --i; )
    {
        ++degree[get_int()];

        get_int();
    }

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

    degree[N + 1] = M;

    p = -1; get_int(); get_int(); get_int();

    for(int i = M + 1; --i; )
    {
        u = get_int();

        v = get_int();

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

    BFS(start);

    freopen("bfs.out", "w", stdout);

    p = -1;

    for(int i = 1; i <= N; ++i)
    {
        put_int(level[i]);
    }

    fwrite(buffer, 1, p, stdout);

    return 0;
}