#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

int N,M;

int const Nlim=100001;
vector <int> Muchii[Nlim];
int distanta[Nlim];
queue <int> coada;

void BFS()
{
    int nod, vecin;
    while(!coada.empty())
    {
        nod=coada.front();
        coada.pop();
        for(unsigned 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 citire()
{
    int nod_start;
    f>>N>>M>>nod_start;
    int x,y;
    for(int i=1;i<=M;i++)
    {
        f>>x>>y;
        Muchii[x].push_back(y);
    }
    for(int i=1;i<=N;i++)
        distanta[i]=-1;

        distanta[nod_start]=0;

        coada.push(nod_start);
        BFS();
        for(int i=1;i<=N;i++)
            g<<distanta[i]<<" ";

}

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