#include <bits/stdc++.h>


using namespace std;

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

int N,M,S;
const int NMAX = 100005;
int distanta[NMAX];
vector<int> Muchii [NMAX];
queue <int> Coada;

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

void bfs()
{
    int nod, vecin;
    while(!Coada.empty())
    {
        nod = Coada.front();
        Coada.pop();
        for( int i =0; i< Muchii[nod].size();i++)
        {
            vecin = Muchii[nod][i];
            if(distanta[vecin]==-1)
            {
                Coada.push(vecin);
                distanta[vecin]=distanta[nod]+1;
            }
        }
    }
}
void solve()
{
    for ( int i =1 ;i<= N ; i++)
    {
        distanta[i]=-1;
    }
    distanta[S]=0;
    Coada.push(S);
    bfs();
    for (int i = 1;i<=N;i++)
        g<<distanta[i]<<" ";
}

int main()
{
    citire();
    solve();
    return 0;
}