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

int main() {
    std::ifstream input("bfs.in");
    std::ofstream output("bfs.out");

    int n, m, s;

    input >> n >> m >> s;

    std::vector<std::vector<int>> graph(n + 1);

    for (int i = 0; i < m; ++i) {
        int x, y;
        input >> x >> y;
        graph[x].push_back(y);
    }

    std::vector<int> dst(n + 1, -1);
    std::vector<bool> visited(n + 1, false);
    dst[s] = 0;
    visited[s] = true;
    std::queue<int> queue;
    queue.push(s);

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

        for (const auto &x: graph[front]) {
            if (!visited[x]) {
                queue.push(x);
                visited[x] = true;
                dst[x] = dst[front] + 1;
            }
        }
    }

    for (int i = 1; i <= n; ++i) output << dst[i] << " ";

    return 0;
}