#include <bits/stdc++.h>
#define INF 10000000
using namespace std;
ifstream ci("bfs.in");
ofstream cou("bfs.out");

int n,m,s;
vector<int>v[100005];
queue<int>q;
int dp[100005];

void citire(){
    ci>>n>>m>>s;
    int a,b;

    for(int i=1;i<=m;i++){
        ci>>a>>b;
        v[a].push_back(b);
    }

}

void Bfs(){
    int nod;

    for(int i=1;i<=n;i++){
        dp[i]=INF;
    }
    dp[s]=0;
    q.push(s);
    while(!q.empty()){

        nod=q.front();
        q.pop();

        for(auto i:v[nod]){
            if(dp[i]>dp[nod]+1 ){
                dp[i]=dp[nod]+1;
                q.push(i);
            }
        }


    }
    for(int i=1;i<=n;i++){
        if(dp[i]==INF){
            cou<<"-1 ";
        }else{
            cou<<dp[i]<<" ";
        }
    }
}


int main()
{
    citire();
    Bfs();
    //.push(s);
    return 0;
}