#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <string.h>

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

const int NMax = 1e5 + 2;
int N, M, S;
vector <int> G[NMax];
queue <int> Q;

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

void BFS (int Nod){
    int Dist[NMax];
    memset (Dist, -1, NMax);
    Q.push(Nod);
    Dist[Nod] = 0;
    while (!Q.empty()){
        Nod = Q.front();
        Q.pop();
        for (int j = 0; j < (int)G[Nod].size(); j++)
            if (Dist[G[Nod][j]] == -1){
                Dist[G[Nod][j]] = Dist[Nod] + 1;
                Q.push(G[Nod][j]);
            }
    }
    for (int i = 1; i <= N; i++)
        out << Dist[i] << " ";
}

int main(){
    Citire();
    BFS(S);
    return 0;
}