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

using namespace std;

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

    int numarNoduri, numarMuchii, nodSursa;
    fin >> numarNoduri >> numarMuchii >> nodSursa;

    vector<vector<int>> listaAdiacenta(numarNoduri + 1);

    for (int i = 0; i < numarMuchii; ++i) {
        int nodPlecare, nodSosire;
        fin >> nodPlecare >> nodSosire;
        listaAdiacenta[nodPlecare].push_back(nodSosire);
    }

    vector<int> distanta(numarNoduri + 1, -1);
    queue<int> coada;

    distanta[nodSursa] = 0;
    coada.push(nodSursa);

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

        for (int vecin : listaAdiacenta[nodCurent]) {
            if (distanta[vecin] == -1) {
                distanta[vecin] = distanta[nodCurent] + 1;
                coada.push(vecin);
            }
        }
    }

    for (int i = 1; i <= numarNoduri; ++i) {
        fout << distanta[i] << (i == numarNoduri ? "" : " ");
    }
    fout << "\n";

    return 0;
}