#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>

#define BUF_SIZE 16384
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi;
inline char nextch(){
    if(pbuf==BUF_SIZE){
        fread(buf, BUF_SIZE, 1, fi);
        pbuf=0;
    }
    return buf[pbuf++];
}
inline int nextnum(){
    int a=0;
    char c=nextch();
    while(c<'0' || c>'9')
        c=nextch();
    while('0'<=c && c<='9'){
        a=a*10+c-'0';
        c=nextch();
    }
    return a;
}

std::vector <int> G[100001];
int d[100001];
int q[100001], p, u;

int main(){
    int n, m, s;
    FILE*fo;
    fi=fopen("bfs.in","r");
    fo=fopen("bfs.out","w");
    n=nextnum();
    m=nextnum();
    s=nextnum();
    for(int i=0;i<m;i++){
        int a=nextnum(), b=nextnum();
        G[a].push_back(b);
    }
    p=u=0;
    q[u++]=s;
    d[s]=1;
    while(p<u){
        for(int i=0;i<G[q[p]].size();i++)
            if(d[G[q[p]][i]]==0){
                d[G[q[p]][i]]=d[q[p]]+1;
                q[u++]=G[p[q]][i];
            }
        p++;
    }
    for(int i=1;i<=n;i++)
        fprintf(fo,"%d ", d[i]-1);
    fclose(fi);
    fclose(fo);
    return 0;
}