#include <bits/stdc++.h>
using namespace std;

ifstream ci("bfs.in");
ofstream cou("bfs.out");

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

void citire(){
    ci>>n>>m>>s;
    int x,y;
    for(int i=1;i<=m;i++){

        ci>>x>>y;
        v[x].push_back(y);
    }

}



void Bfs(int origine){

    q.push(origine);
    viz[origine]=0;
    while(q.size()!=0){

        int nod = q.front();
        q.pop();
        for(auto i:v[nod]){
            if(viz[i]>viz[nod]+1||(viz[i]==0&&i!=origine)){
                viz[i]=viz[nod]+1;
                q.push(i);
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(viz[i]==0&&i!=origine){
            viz[i]=-1;
        }
    }
}

void rez(){

    Bfs(s);
    for(int i=1;i<=n;i++){
        cou<<viz[i]<<" ";
    }
}

int main()
{
    citire();
    rez();

    return 0;
}