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

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

int main() {
    int N,M,S;
    fin>>N>>M>>S;

    vector<vector<int>> lista_adiacenta(N+1);
    for(int i=0;i<M;i++) {
        int x,y;
        fin>>x>>y;
        lista_adiacenta[x].push_back(y);
    }

    vector<int> distante(N+1,-1);
    queue<int> coada;

    distante[S] = 0;
    coada.push(S);

    while(!coada.empty()) {
        int x = coada.front();
        coada.pop();

        for(int v : lista_adiacenta[x]) {
            if(distante[v] == -1) {
                distante[v] = distante[x] + 1;
                coada.push(v);
            }
        }


    }
    for (int i = 1;i<=N;i++) {
        fout<<distante[i]<<" ";
    }
}