#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int main() {
    int n, m, s;
    fin >> n >> m >> s;

    vector<vector<int>> adj(n + 1);
    for (int i = 0; i < m; i++) {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
    }

    vector<int> dist(n + 1, -1);
    queue<int> q;

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

    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (int vecin : adj[node]) {
            if (dist[vecin] == -1) {
                dist[vecin] = dist[node] + 1;
                q.push(vecin);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        fout << dist[i];
        if (i < n) fout << " ";
    }
    fout << "\n";

    return 0;
}