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

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

const int nMax = 1e5 + 1;
int n, m, s;
vector<int> List[nMax], d(nMax, -1);

void bfs(int node) {
    d[node] = 0;
    queue<int> q;
    q.push(node);
    while (!q.empty()) {
        node = q.front();
        q.pop();
        for (const int& i : List[node]) {
            if (d[i] == -1) {
                d[i] = d[node] + 1;
                q.push(i);
            }
        }
    }
}

int main() {
    fin >> n >> m >> s;
    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        List[x].push_back(y);
    }
    bfs(s);
    for (int node = 1; node <= n; node++) {
        fout << d[node] << " ";
    }

    fin.close();
    fout.close();
    return 0;
}