#include <stdio.h>
#include <string.h>
#include <vector>
#include <queue>
#define NMAX 100005
using namespace std;

int N, M, S;
int i, j, nr, curent, curent2, vizitat[NMAX];

//N varfuri si M arce

vector <int> vf[NMAX];
queue <int> coada;

void bfs(int start){
    nr = 0;
    vizitat[start] = 0;
    coada.push(start);
    while(!coada.empty()){
        curent = coada.front();
        coada.pop();
        for(j = 0; j < vf[curent].size(); j++){
            curent2 = vf[curent][j];
            if(vizitat[curent2] == -1){
                vizitat[curent2] = 1 + vizitat[curent];
                coada.push(curent2);
            }
        }
    }
}

int main(){

    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    scanf("%d%d%d", &N, &M, &S);

    int x, y;

    for(i = 1; i <= M; i++){
        scanf("%d%d", &x, &y);
        vf[x].push_back(y);
    }
    memset(vizitat, (-1), sizeof(vizitat));
    bfs(S);
    for(i = 1; i <= N; i++){
        printf("%d ", vizitat[i]);
    }

}