#include <iostream>
#include <bits/stdc++.h>
#include <queue>
#define NMAX 100005
#define MAXIM 2000000
using namespace std;
vector <int> lista[NMAX];
queue <int> q;
int n, m, dist[NMAX];

void BFS(int nod){

    int k = 0, viz[NMAX], i, S = nod, len;
    for(i = 1;i <= n; ++i){
        viz[i] = 0;
        dist[i] = MAXIM;
    }

    q.push(S);
    dist[S] = 0;
    viz[S] = 1;

    while(!q.empty()){
        S = q.front();
        len = lista[S].size();
        for(i = 0;i < len; ++i)
            if(viz[lista[S][i]] == 0){
                q.push(lista[S][i]);
                viz[lista[S][i]] = 1;
                dist[lista[S][i]] = dist[S] + 1;
            }
        q.pop();
    }
}

int main(){

    FILE *f, *g;
    f = fopen("bfs.in","r");
    g = fopen("bfs.out","w");
    int i, s, x, y;

    fscanf(f,"%d %d %d",&n,&m,&s);
    for(i = 1;i <= m; ++i){
        fscanf(f,"%d %d",&x,&y);
        lista[x].push_back(y);
    }

    BFS(s);
    for(i = 1;i <= n; ++i)
        if(dist[i] == MAXIM)
            fprintf(g,"-1 ");
        else
            fprintf(g,"%d ",dist[i]);





}