#include <fstream>
#include <vector>
#include <queue>
#define DIM 100005

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

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

void bfs(int node) {
    dist[node] = 1;
    q.push(node);
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (auto x: edges[node]) {
            if (dist[x] == 0) {
                dist[x] = dist[node] + 1;
                q.push(x);
            }
        }
    }
}

int main() {
    f >> n >> m >> source;

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

    bfs(source);

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

    return 0;
}