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

using namespace std;

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

    int n, m, start;
    vector<vector<int>> vecini;
    vector<int> dist;
    queue<int> coada;

    fin >> n >> m >> start;

    vecini.resize(n + 1);
    dist.resize(n + 1, -1);

    for (int i = 0; i < m; i++) {
        int vf1, vf2;
        fin >> vf1 >> vf2;
        vecini[vf1].push_back(vf2);
    }

    coada.push(start);
    dist[start] = 0;

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

        for (int i : vecini[curent]) {
            if (dist[i] == -1) {
                coada.push(i);
                dist[i] = dist[curent] + 1;
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        fout << dist[i] << " ";
    }
    fout << "\n";

    return 0;
}