#include <fstream.h>
#include <vector>

using namespace std;

#define MaxP 100005

long int G[MaxP], S[MaxP], Cost[MaxP];
vector <long int> A[MaxP];

void BFS(int nod)
{
    long int L = 1, i, j;

    memset (Cost, -1, sizeof(Cost));    // Marchez toate nodurile ca fiind nevizitate

    //  Introduc nodul de start in coada
    S[L] = nod;
    Cost[nod] = 0;

    for (i = 1; i <= L; i++)    //  Elimin pe rand nodurile din coada
        for (j = 0; j < G[S[i]]; j++)   //  Parcurg vecinii nodului ce urmeaza sa fie eliminat
            if (Cost[A[S[i]][j]] == -1)
            {
                //  Adaug vecinii nevizitati in coada si le calculez distanta
                S[++L] = A[S[i]][j];
                Cost[S[L]] = Cost[S[i]] + 1;
            }
}

int main()
{
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");

    long int M , N, Start, x, y;

    fin>>N>>M>>Start;

    //  Citesc arcele si retin graful sub forma de lista de vecini

    while (fin>>x>>y) A[x].push_back(y);

    for (long int i = 1; i <= N; i++) G[i] = A[i].size();

    BFS(Start);

    for (long int i = 1; i <= N; i++) fout<<Cost[i]<<' ';

    return 0;
}