#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
const int MAXN = 100001;
vector <int> listaAdiacenta[MAXN];
vector <int> distanta;
int N, M, S;
void bfs() {
    distanta.assign(N+1, -1);
    queue <int> coada;
    distanta[S] = 0;
    coada.push(S);
    while (!coada.empty()) {
        int nodCurent = coada.front();
        coada.pop();
        for (auto vecin : listaAdiacenta[nodCurent]) {
            if (distanta[vecin] == -1) {
                distanta[vecin] = distanta[nodCurent] + 1;
                coada.push(vecin);
            }
        }
    }
}
int main() {
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    fin >> N >> M >> S;
    for (int i = 0; i < M; i++) {
        int a, b;
        fin >> a >> b;
        listaAdiacenta[a].push_back(b);
    }
    bfs();
    for (int i = 1; i <= N; i++) {
        fout << distanta[i] << " ";
    }

    return 0;
}