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

using namespace std;

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


vector<int> bfs(int s, vector<vector<int>> &la, int N) {
    vector<int> viz(N + 1, 0), d(N + 1, -1);

    queue<int> q;

    viz[s] = 1;
    q.push(s);
    d[s] = 0;

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

        for (int& vecin : la[crt]) {
            if (viz[vecin] == 0) {
                viz[vecin] = 1;
                d[vecin] = d[crt] + 1;
                q.push(vecin);
            }
        }
    }

    return d;

}

int main() {
    int N, M, start;

    fin >> N >> M >> start;

    vector<vector<int>> la(N + 1);
    for (int i = 0; i < M; i++) {
        int x, y;
        fin >> x >> y;

        la[x].push_back(y);
    }

    vector<int> d = bfs(start, la, N);

    for (int i = 1; i <= N; i++) {
        fout << d[i] << ' ';
    }
     
    return 0;

}