#include <fstream>
#include <vector>
#include <deque>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int N, M, S;
int x, y;
const int Nmax = 100001;
vector <int> v[Nmax];
deque <int> coada;
int cost[Nmax];
int q;

void citire()
{
    f >> N >> M >> S;
    for(int i = 1; i <= M; i ++)
    {
        f >> x >> y;
        v[x].push_back(y);
    }
}
int main ()
{
    citire();
    coada.push_back(S);
    cost[S] = 1;

    while( !coada.empty() )
    {
        q = coada.front();
        coada.pop_front();

        for(int i = 0; i < v[q].size(); i ++)
        {
            if(cost[ v[q][i] ] == 0)
            {
                coada.push_back(v[q][i]);
                cost[v[q][i]] = cost[q] + 1;
            }
        }
    }
    for(int i = 1; i <= N; i ++)
    {
        g << cost[i] - 1 << ' ';
    }
    return 0;
}