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


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

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

    visited.assign(n + 1, 0);
    distance.assign(n + 1, -1);

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

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

    for (int i = 1; i < distance.size(); i++) {
        g << distance[i] << " ";
    }

    g.close();
}

int main() {
    std::vector <std::vector <int>> adj;
    int n, x;
    read(adj, n, x);
    bf_search(x, adj, n);
    return 0;
}