#include <bits/stdc++.h>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

int main() {
    int n, m, s;
    if (!(f >> n >> m >> s)) return 0;

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

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

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

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

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

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

    return 0;
}