#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

#define NMAX 100005

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");


int n,m;
vector <int > Muchii[NMAX];
int distanta[NMAX];
queue <int> Coada;

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 citire(){
    int nodStart;
    fin>>n>>m>>nodStart;
    for(int i=1;i<=m;i++){
        int x,y;
        fin>>x>>y;
        Muchii[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    {
        distanta[i]=-1;
    }
    distanta[nodStart]=0;

    Coada.push(nodStart);
    BFS();
    for(int i=1;i<=n;i++)
        fout<<distanta[i]<<" ";
}

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