#include<cstdio>
#define maxn 100005
#include<vector>
#include<queue>
using namespace std;
int S,viz[maxn],d[maxn],x,y,n,m,s;
queue <int> Q;
vector <int> G[maxn];
void bfs(int s){
    Q.push(s);
    for(int i=1;i<=n;++i)
        d[i]=-1;
    d[s]=0;
    viz[s]=1;
    while(!Q.empty()){
        x=Q.front();

        Q.pop();
        for(int i=0;i<G[x].size();++i){
            if(!viz[G[x][i]]){
                viz[G[x][i]]=1;
                Q.push(G[x][i]);
                d[G[x][i]]=d[x]+1;
            }
        }

    }
}
int main(){
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&s);
    for(int i=1;i<=m;++i){
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
    }
    bfs(s);
    for(int i=1;i<=n;++i){
        printf("%d ",d[i]);
    }
return 0;


}