#include <bits/stdc++.h>

/*
#define BUFFER_SIZE 12500000

char buffer[BUFFER_SIZE], *head = buffer, *writeHead = buffer;

bool isDigit[255];

void parseInit()
{
    buffer[fread(buffer, 1, BUFFER_SIZE, stdin)] = 0;

    for(int i = 47; i < 58; ++i) isDigit[i] = 1;
}
*/

const int MAXBUF = 20000000;
char buffer[MAXBUF];
char *head;
int isDigit[255];
char *writeHead;

void parseInit()
{
    int a = fread(buffer, 1, MAXBUF, stdin);

    buffer[a] = 0;

    head = buffer;

    memset(isDigit, 0, sizeof isDigit);

    for(int i = 47; i < 58; ++i) isDigit[i] = 1;

    writeHead = head;
}

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

    for(; !isDigit[*head]; ++head);

    for(;  isDigit[*head]; ++head)

        number = number * 10 + (*head) - 48;

    return number;
}

__attribute__((always_inline)) void put_int(int x)
{
    if(x == 0)
    {
        *(writeHead++) = 48; *(writeHead++) = 32;

        return;
    }

    if(x < 0)
    {
        *(writeHead++) = 45; *(writeHead++) = 49; *(writeHead++) = 32;

        return;
    }

    char *old = writeHead;

    while(x)
    {
        *(writeHead++) = x % 10 + 48;

        x /= 10;
    }

    std::reverse(old, writeHead);

    *(writeHead++) = 32;
}

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);

    parseInit();

    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;

    head = buffer;

    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)
    {
        put_int(level[i]);
    }

    fwrite(buffer, 1, writeHead - buffer, stdout);

    return 0;
}