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

std::vector<int> graf[100001];
std::queue <int> coada;
int costuri[100001];
int G[100001];
void BFS(int S){
    costuri[S] = 0;
    coada.push(S);
    while(!coada.empty()){
        std::cout << coada.front();
        int nod = coada.front();
        for(int i = 0; i < G[nod]; ++i){
            if(costuri[graf[nod][i]] == -1){
                coada.push(graf[nod][i]);
                costuri[graf[nod][i]] = costuri[nod] + 1;
            }
        }
        coada.pop();
    }
}

int main()
{
    std::ifstream in("bfs.in");
    std::ofstream out("bfs.out");

    int N, M, S;
    in >> N >> M >> S;
    for(int i = 1; i <= M; ++i){
        int x;
        int y;
        in >> x >> y;
        graf[x].push_back(y);
    }

    for(int i = 1; i <= N; ++i)
    {
        G[i] = graf[i].size();
    }

    for(int i = 1; i <= N; ++i){
        costuri[i] = -1;
    }

    BFS(S);
    for(int i = 1; i <= N; ++i){
        out << costuri[i] << ' ';
    }
    return 0;
}