#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};
queue<int> coada;

int bfs(int S, int F)
{
    int nr_min_arce = 0;
    coada.push(S);
    int x;
    vector<int>costuri;

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

       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

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

    return 0;
}