#include <cstdio>
#include <queue>
#include <vector>
#define NMAX 100000

void bfs(int node, std::vector<int> *adj, int *dist) {
    std::queue<int> q;

    dist[node] = 0;
    q.push(node);

    while (!q.empty()) {
        node = q.front();
        printf("%d\n", node);
        q.pop();

        for (auto it = adj[node].begin(); it != adj[node].end(); it++) {
            if (dist[*it] == -1) {
                dist[*it] = dist[node] + 1;
                q.push(*it);
            }
        }
    }
}

int main() {
    std::vector<int> adj[NMAX + 1];
    int n, m, s, x, y, dist[NMAX + 1];
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    scanf("%d%d%d", &n, &m, &s);
    while (m--) {
        scanf("%d%d", &x, &y);
        adj[x].push_back(y);
    }

    for (int i = 1; i <= n; i++) {
        dist[i] = -1;
    }
    bfs(s, adj, dist);
    for (int i = 1; i <= n; i++) {
        printf("%d ", dist[i]);
    }
}