#include <iostream>
#include <fstream>
#include <bits/stdc++.h>

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

vector<int> adiacenta[100009];
//bool vizitat[100009] = {false};
int cost[100009];
queue<int> coada;

void bfs(int S)
{
    memset(cost, -1, sizeof(cost));
    int nr_min_arce = 0;
    coada.push(S);
    cost[S] = 0;

    while(!coada.empty())
    {
       int x = coada.front();
        coada.pop();
        for(auto i : adiacenta[x])///se parcurg vecinii lui x
            if(cost[i] == -1)
            {
                coada.push(i);
                cost[i] = cost[x] + 1;
            }

       //if(x == F)
        //{  return nr_min_arce;

        //}
        //nr_min_arce++;
     }

     //if(!costuri.empty())


    // return -1;

}
int main()
{
    int N,M,S,x,y;
    in>>N>>M>>S;
     for(int i =1; i <=M ;i++)
    {
        in>>x>>y;
        adiacenta[x].push_back(y);
        //graf orientat x y  muchie => fdoar x e vecinul lui y

    }
    bfs(S);
    for(int i = 1; i <= N; i++)
    {
        out<<cost[i]<<" ";
    }
    out<<"\n";

    return 0;
}