#include <bits/stdc++.h>
#define INFILE "bfs.in"
#define OUTFILE "bfs.out"
#define DIM 100005
#define INF 0x3f3f3f3f

using namespace std;

ifstream f(INFILE);
ofstream g(OUTFILE);

int n, m, startingNode;
int dist[DIM];
vector <int> edges[DIM];
queue <int> q;

int main() {

    f >> n >> m >> startingNode;

    for (int i = 1; i <= m; i++) {
        int x, y;
        f >> x >> y;
        edges[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
        dist[i] = INF;
    dist[startingNode] = 0;

    q.push(startingNode);
    while (!q.empty()) {
        int node = q.front();
        q.pop();

        for (auto k: edges[node]) {
            if (dist[k] == INF) {
                dist[k] = dist[node] + 1;
                q.push(k);
            }
        }
    }

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

    return 0;
}