#include<bits/stdc++.h>
using namespace std;
int N, M, nodStart;
int const NLIM = 100005;
vector<int> muchii[NLIM];

int distanta[NLIM];

queue <int> coada;

void BFS(){
    int nod, vecin;
    while(!coada.empty()){
        nod = coada.front();
        coada.pop();
        for (unsigned int i = 0; i < muchii[nod].size(); i++){
            vecin = muchii[nod][i];
            if (distanta[vecin] == -1){
                coada.push(vecin);
                distanta[vecin] = distanta[nod] + 1;
            }
        }
    }
}

void citire(){
    cin >> N >> M >> nodStart;
    for (int i = 1; i <= M; i++){
        int x, y;
        cin >> x >> y;
        muchii[x].push_back(y);
    }
    for (int i = 1; i <= N; i++){
        distanta[i] = -1;
    }
    distanta[nodStart] = 0;
    coada.push(nodStart);
    BFS();
    for (int i = 1; i <= N; i++) cout << distanta[i] << " ";
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    citire();
    return 0;
}