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

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

const int NMAX = 1e5;
std::vector<int> L[NMAX + 1];
int dist[NMAX +  1];

void bfs(int start){
    dist[start] = 0;
    std::queue<int> q;
    q.push(start);
    while(!q.empty()){
        auto node = q.front();
        q.pop();
        for (auto next: L[node]){
            if(dist[next] == -1){
                dist[next] = dist[node] + 1;
                q.push(next);
            }
        }
    }
}
int main() {

    int N, M, s;
    f >> N >> M >> s;
    for(int i = 1; i <= M; ++i){
        int x, y;
        f >> x >> y;
        L[x].push_back(y);
    }
    for (int i = 1; i <= N; ++i)
        dist[i] = -1;
    bfs(s);
    for(int i = 1; i <= N; ++i)
        g << dist[i] << " ";

    return 0;
}