#include <iostream>
#include <cstdio>
using namespace std;

const int dmax = 1000;

int lst[dmax+1];
int urm[dmax*dmax+1];
int vf[dmax*dmax+1];
int nr;

int C[dmax+1];
int viz[dmax+1];

int N, M, S;

void adauga(int x, int y)
{
    //ADAUGA IN LISTA LUI x PE y

    nr++;
    vf[nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
}

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

    int i, x, y, p, first, last;

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

    for(i = 1; i <= M; i++)
    {
        scanf("%d %d", &x, &y);

        adauga(x,y);
        //adauga(y,x);
    }

    /*for(x = 1; x <= N; x++)
    {
        printf("%d: ", x);

        p = lst[x];

        while(p)
        {
            y = vf[p];

            printf("%d ", y);

            p = urm[p];
        }

        printf("\n");
    }

    printf("\n");*/

    for(i = 1; i <= N; i++) viz[i] = -1;

    first = last = 1;

    //INSERAM NODUL S CU COSTUL 0
    C[1] = S;
    viz[S] = 0;

    while(first <= last)
    {
        x = C[first];

        //PARCURGEM LISTA VECINILOR y AI LUI x

        p = lst[x];

        while(p)
        {
            y = vf[p];

            if(viz[y] == -1)
            {
                last++;
                C[last] = y;
                viz[y] = 1 + viz[x];
            }

            p = urm[p];
        }

        first++;
    }

    for(i = 1; i <= N; i++) printf("%d ", viz[i]);


    return 0;
}