//
// Created by Darius on 10/15/2026.
//
#include <iostream>
#include <vector>
#include <queue>

using namespace std;

const int INF = 1e9;
const int NMAX = 100005;

int n, m, s;
vector<int> L[NMAX];
int d[NMAX];

void bfs(int sursa) {
    for (int i = 1; i <= n; i++) {
        d[i] = INF;
    }
    d[sursa] = 0;
    queue<int> q;
    q.push(sursa);
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (auto vec : L[node]) {
            if (d[vec] > d[node] + 1) {
                //d[vec] == INF
                d[vec] = d[node] + 1;
                q.push(vec);
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m >> s;
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        L[x].push_back(y);
        // L[y].push_back(x); // decomenteaza daca graful este neorientat
    }

    bfs(s);

    for (int i = 1; i <= n; i++) {
        if (d[i] == INF) {
            cout << -1 << " ";
        } else {
            cout << d[i] << " ";
        }
    }
    cout << "\n";

    return 0;
}