#include <cstdio>
#include <malloc.h>

int *Graph[100001], degree[100001], level[100001], u[1000001], v[1000001];

void BFS(int start)
{
    int queue[100001], left = 0, right = 0, *p;

    queue[0] = start;

    level[start] = 1;

    while(left <= right)
    {
        p = Graph[queue[left]] + 1;

        int child = *p;

        while(*p != -1)
        {
            if(!level[child])
            {
                queue[++right] = child;

                level[child] = level[queue[left]] + 1;
            }

            ++p;
        }

        ++left;
    }
}

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

    int N, M, start;

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

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

        ++degree[u[i]];
    }

    for(int i = 1; i <= N; ++i)
    {
        Graph[i] = (int*)malloc((degree[i] + 2) * sizeof(int));

        Graph[i][degree[i] + 1] = -1;

        degree[i] = 0;
    }

    for(int i = 1; i <= M; i++)
    {
        Graph[u[i]][++degree[u[i]]] = v[i];
    }

    BFS(start);

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

    return 0;
}