#include <stdio.h>
#include <vector>

using namespace std;

#define maxn 100010

int N, M, L, S;
vector <int> G[maxn];
int Lg[maxn], c[maxn], viz[maxn];

void BFS(int x)
{
    int i, j,z,p,u,w;

    viz[x] = 1;
    c[1] = x;
    p=u=1;
    while(p<=u)
        {
            w=c[p];p++;
            for (j = 0; j < G[w].size(); j++)
            {
                z=G[w][j];
                if (viz[z] == 0)
                {
                    u++;
                    c[u]= z;
                    viz[z] =viz[w] + 1;
                }
            }
        }
}

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

    int i, x, y;

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

    for (i = 1; i <= M; i++)
    {
        scanf("%d %d ", &x, &y);
        G[x].push_back(y);
    }
    BFS(S);
    for (i = 1; i <= N; i++)
        printf("%d ", viz[i]-1);
    printf("\n");

    return 0;
}