#include <vector>
#include <fstream>

using namespace std;

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

int main() {
    int n, m, s, conex_count = 0;
    fin >> n >> m >> s;

    vector<vector<int>> graph(n + 1);
    for (int i = 0; i < m; ++i) {
        int u, v;
        fin >> u >> v;
        graph[u].push_back(v);
    }

    vector<bool> visited(n + 1, false);
    vector<int> queue;
    vector<int> answer(n + 1, -1);
    answer[s] = 0;

    queue.push_back(s);
    visited[s] = true;

    while (!queue.empty()) {
        int current = queue.front();
        queue.erase(queue.begin());

        for (int neighbor : graph[current]) {
            if (!visited[neighbor]) {
                answer[neighbor] = answer[current] + 1;
                visited[neighbor] = true;
                queue.push_back(neighbor);
            }
        }
    }

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

    return 0;
}