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

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

int n, m, start, a, b;

int const NLIM=100001;
vector<int>v[NLIM];
queue<int>coada;

int distanta[NLIM];

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

int main()
{
    int n;
    fin>>n>>m>>start;
    for(int i=1; i<=m; i++){
        fin>>a>>b;
        v[a].push_back(b);
    }
    for(int i=1; i<=n; i++)
        distanta[i]=-1;
        distanta[start]=0;
    coada.push(start);
    bfs();
    for(int i=1; i<=n; i++){
        fout<<distanta[i]<<" ";
    }
    return 0;
}