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

using namespace std;

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

const int limita=100005;
vector<int>adiacenta[limita];
queue<int>coada;
int distanta[limita];
int n,m,s;

void citire() {
fin>>n>>m>>s;
for(int i=0;i<m;i++) {
    int x,y;
    fin>>x>>y;
    adiacenta[x].push_back(y);
}
for(int i=1;i<=n;i++)
    distanta[i]=-1;
}

void bfs() {
    int nod,vecin;
    while(coada.empty()!=0) {
        nod=coada.front();
        coada.pop();
        for(int i=0;i<adiacenta[nod].size();i++) {
            vecin=adiacenta[nod][i];
            if(distanta[vecin]== -1) {
                coada.push(vecin);
                distanta[vecin]=distanta[nod]+1;
            }
        }

    }

}


int main()
{
    citire();
    coada.push(s);
    distanta[s]=0;
    bfs;
    for(int i=1;i<=n;i++) {
       fout<<distanta[i]<<" ";


    }

    return 0;
}