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


vector<int> lista[100001];
int d[100001];

void BFS(int s, int n) {
    for (int i = 1; i <= n; i++) {
        d[i] = -1;
    }

    queue<int> q;
    d[s] = 0;
    q.push(s);

    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int v : lista[u]) {
            if (d[v] == -1) {
                d[v] = d[u] + 1;
                q.push(v);
            }
        }
    }
}

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

    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        lista[u].push_back(v);
    }

    BFS(s, n);

    for (int i = 1; i <= n; i++) {
        cout << d[i] << " ";
    }
    cout << endl;

    return 0;
}