#include<iostream>
#include<fstream>
#include<queue>
 
using namespace std;
 
#define MAX_NODES 100001
 
vector <int> graph[MAX_NODES];
queue <int> aux;
int checked[MAX_NODES], cost[MAX_NODES];
 
int main(){
ifstream in; ofstream out;
in.open("bfs.in"); out.open("bfs.out");
out.clear();
 
int n,m,s,x,y,i; 
vector<int>::iterator it;
 
in>>n>>m>>s;
for(i=1;i<=m;i++){
  in>>x>>y;
  graph[x].push_back(y);
}
 
aux.push(s); checked[s]=1; 
while(!aux.empty()){
   x=aux.front(); aux.pop();
   for(it=graph[x].begin(); it!=graph[x].end();it++){
       if(checked[*it]==0) {
           checked[*it]=1; 
           cost[*it]=cost[x]+1;
           aux.push(*it);
       }
   }
}
 
for(i=1;i<=n;i++)
    if(checked[i]==1) out<<cost[i]<<" ";
    else out<<"-1 ";
 
in.close(); out.close();
return 0;
}