#include <bits/stdc++.h>
using namespace std;
#define LMAX 100005
int n,dist[LMAX];
void Init(){
    for(int i=1;i<=n;++i)
        dist[i]=-1;
}
vector<int> G[LMAX];
void bfs(int nod){
    queue<int> Q;
    Q.push(nod);
    dist[nod]=0;
    while(!Q.empty()){
        nod=Q.front();
        Q.pop();
        for(auto it : G[nod])
            if(dist[it]==-1){
                dist[it]=dist[nod]+1;
                Q.push(it);
            }
    }
}
int main(){
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int m,s;
    scanf("%d %d %d",&n,&m,&s);
    for(int i=1;i<=m;++i){
        int from,to;
        scanf("%d %d",&from,&to);
        G[from].push_back(to);
    }
    Init();
    bfs(s);
    for(int i=1;i<=n;++i)
        printf("%d ",dist[i]);
    return 0;
}