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

#define NMAX 1000001

std::vector <int> adj[NMAX];
int visited[NMAX], distance[NMAX];

void read(int &n, int &node) {
    std::ifstream f("bfs.in");
    f >> n;
    int edges;
    f >> edges;
    f >> node;
    for (int i = 0; i < edges; i++) {
        int x, y;
        f >> x >> y;
        adj[x - 1].push_back(y - 1);
    }
    f.close();
}

void bf_search(int x, int n) {
    std::queue <int> q;

    for (int i = 0; i < n; i ++) {
        visited[i] = 0;
        distance[i] = -1;
    }

    distance[x] = 0;
    q.push(x);
    while (!q.empty()) {
        visited[q.front()] = 1;
        for (int to_node : adj[q.front()]) {
            if (!visited[to_node]) {
                q.push(to_node);
                distance[to_node] = distance[q.front()] + 1;
            }
        }
        q.pop();
    }

    std::ofstream g("bfs.out");

    for (int i = 0; i < n; i++) {
        g << distance[i] << " ";
    }

    g.close();
}

int main() {
    int n, x;
    read(n, x);
    bf_search(x - 1, n);
    return 0;
}