#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
const int inf=100001;
vector<vector<int>>gr;
vector<int>distanta;
queue<int>q;
void BFS(int nod){
    int nod_curent;
    q.push(nod);
     distanta[nod]=0;
     while(!q.empty()){
        nod_curent=q.front();
        q.pop();
        for(int i=0;i<gr[nod_curent].size();i++){
            if(distanta[gr[nod_curent][i]]==inf){
                 q.push(gr[nod_curent][i]);
            }
            distanta[gr[nod_curent][i]]=min(distanta[gr[nod_curent][i]],distanta[nod_curent]+1);
        }
     }

}
int main(){
int n,m,nod,nod1,nod2;
cin>>n>>m>>nod;
gr.resize(n+1);
distanta.resize(n+1,inf);
for(int i=1;i<=m;i++){
    cin>>nod1>>nod2;
    gr[nod1].push_back(nod2);
}
BFS(nod);
for(int i=1;i<=n;i++){
    if(distanta[i]==inf){
        cout<<-1<<" ";
    }else{
        cout<<distanta[i]<<" ";
    }
}
}