#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
std::ifstream f("bfs.in");
std::ofstream g("bfs.out");
std::vector<int> dist;
std::vector<std::vector<int>> graph;
void bfs(int node) {
    std::queue<int> queue;
    queue.push(node);
    dist[node]=1;
    while (!queue.empty()) {
        node=queue.front();
        queue.pop();
        for (int next:graph[node]) {
            if (dist[next]==0) {
                queue.push(next);
                dist[next]=dist[node]+1;
            }
        }
    }
}

int main() {
    int n, m, s, x, y;
    f>>n>>m>>s;
    dist.assign(n+1, 0);
    graph.assign(n+1, std::vector<int>());
    for (int i=1; i<=m; i++) {
        f>>x>>y;
        graph[x].push_back(y);
    }
    bfs(s);
    for (int i=1; i<=n; i++) {
        g<<dist[i]-1<<" ";
    }
    return 0;
}