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

using namespace std;

vector<int> bfs(int src, vector<vector<int>>& edges) {
    vector<int> dist(edges.size(), -1);

    queue<int> q;
    dist[src] = true;
    q.push(src);

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

        for (auto nxt : edges[node]) {
            if (dist[nxt] == -1) {
                dist[nxt] = dist[node] + 1;
                q.push(nxt);
            }
        }
    }

    return dist;
}

int main() {
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");

    int n, m; cin >> n >> m;
    int src; cin >> src; src--;

    vector<vector<int>> edges(n);
    for (int i = 0; i < m; i++) {
        int a, b; cin >> a >> b;
        a--; b--;
        edges[a].push_back(b);
        // edges[b].push_back(a);
    }

    vector<int> dist = bfs(src, edges);
    for (auto i : dist) {
        cout << i << " ";
    }
    cout << "\n";

    return 0;
}