#include <iostream>
#include <cstdio>
using namespace std;
const int NMAX = 100000;
const int MMAX = 1000000;
int urm[2*MMAX+1],vf[2*MMAX+1],last[NMAX+1],d[NMAX+1],nr,n;
int q[NMAX];

void adauga(int x, int y){
    vf[++nr] = y;
    urm[nr] = last[x];
    last[x] = nr;
}

void bfs(int x0){
    int st,dr;
    for(int i=1; i<=n; i++)
        d[i] = -1;
    st = 0, dr = -1;
    q[++dr] = x0;
    d[x0] = 0;
    while(st <= dr){
        int nod = q[st++];
        for(int p=last[nod]; p!=0; p=urm[p]){
            int next = vf[p];
            if(d[next] == -1){
                q[++dr] = next;
                d[next] = 1+d[nod];
            }
        }
    }
}

int main()
{
    FILE *fin, *fout;
    int m,start,i,x,y;
    fin = fopen("bfs.in","r");
    fout = fopen("bfs.out","w");
    fscanf(fin,"%d %d %d",&n,&m,&start);
    for(i=0; i<m; i++){
        fscanf(fin,"%d %d",&x,&y);
        adauga(x,y);
    }
    bfs(start);
    for(i=1; i<=n; i++)
        fprintf(fout,"%d ",d[i]);
    fclose(fin);
    fclose(fout);
    return 0;
}