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

using namespace std;

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

const int NMAX = 100010;
const int MMAX = 1000010;

int N, M, S;
vector<int> G[NMAX];
queue <int> Q;

int dist[NMAX];
void BFS (int start) {
    Q.push(start);
    dist[start] = 1;

    while ( !Q.empty()) {
        for (auto &it : G[Q.front()]) {
            if (dist[it] == 0) {
                Q.push (it);
                dist[it] = dist[Q.front()] + 1;
            }
        }

        Q.pop();
    }
}

int main () {
    fin >> N >> M >> S;

    for (int i = 1; i <= M; i++) {
        int x, y;
        fin >> x >> y;
        G[x].push_back (y);
    }

    BFS(S);
    for (int i = 1; i <= N; i++) {
        if (dist[i] == 0) fout << -1 << " ";
        else fout << dist[i] - 1 << " ";
    }
    fout << '\n';

    return 0;
}