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

using namespace std;

void bfs(int s, const vector<vector<int>>& adj, vector<int>& dist) {
    queue<int> q;
    dist[s] = 0;
    q.push(s);

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

        for (int vecin : adj[nod]) {
            if (dist[vecin] == -1) {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }
}

int main() {
    ifstream f("bfs.in");
    ofstream fout("bfs.out");

    if (!f.is_open() || !fout.is_open()) {
        return 1;
    }

    int n, m, s;
    f >> n >> m >> s;

    vector<vector<int>> adj(n + 1);

    for (int i = 0; i < m; i++) {
        int x, y;
        f >> x >> y;
        adj[x].push_back(y);
    }

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

    bfs(s, adj, dist);

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

    f.close();
    fout.close();

    return 0;
}