#include <iostream>
#include <fstream>dd
#include <queue>
#include <vector>
#define MAXM 1000001
#define MAXN 100001
#define uint unsigned int

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int range[MAXM];
vector <int> MC[MAXM];
queue <int> myq;
int n,m,s;
int main(){
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++){
        int x,y;
        fin>>x>>y;
        if(x!=y)
            MC[x].push_back(y);
    }
    myq.push(s);
    while(!myq.empty()){
        int nod=myq.front();
        cout<<nod<<' ';
        myq.pop();
        for(uint i=0;i<MC[nod].size();i++){
            if(range[MC[nod][i]]==0 and MC[nod][i]!=s){
                range[MC[nod][i]]=range[nod]+1;
                myq.push(MC[nod][i]);
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(range[i]==0 and i!=s) fout<<-1<<' ';
        else fout<<range[i]<<' ';
    }
    return 0;
}