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

using namespace std;

const int N_MAX = 1e5;

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

int N, M, S;
vector<int> G[N_MAX + 5];

int dist[N_MAX + 5];
queue<int> q;

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

    memset(dist, -1, sizeof dist);
    dist[S] = 0;
    q.push(S);

    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (int i : G[node])
            if (dist[i] == -1) {
                dist[i] = dist[node] + 1;
                q.push(i);
            }
    }

    for (int i = 1; i <= N; ++i)
        fout << dist[i] << " ";
    fout << "\n";
    return 0;
}