#include <bits/stdc++.h>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int main() {
    int N, M, S;
    f >> N >> M >> S;

    vector<vector<int>> G(N + 1);
    for (int i = 0; i < M; i++) {
        int u, v;
        f >> u >> v;
        G[u].push_back(v);
    }

    vector<int> dist(N + 1, -1);
    queue<int> q;
    q.push(S);
    dist[S] = 0;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int v : G[u]) {
            if (dist[v] == -1) {
                dist[v] = dist[u] + 1;
                q.push(v);
            }
        }
    }

    for (int i = 1; i <= N; i++) {
        g << dist[i] << " ";
    }

    f.close();
    g.close();
}
// 4 3 5 6 1

//     6 [1,5]
//   5    6
// 4  5  6 1
// 4 3