#include <fstream>
#include <vector>
 #include <queue>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
  vector <int> v[100001];
  queue <int> q;
  int n,m,s,x,y,d[100001];
  // v[i] este un vector
 int main(){
   in>>n>>m>>s;
   for(int i=1;i<=m;i++)
   {
     in>>x>>y; // x->y
     v[x].push_back(y);
   }
   q.push(s);
   for(int i=1;i<=n;i++)d[i]=-1;
   d[s]=0;// o distanta care exista
   while ( !q.empty())
   {
      x=q.front();
     // toti vecinii lui x nevizitati d[vecin]==-1
     int l=v[x].size();
     for(int i=0;i<l;i++)
      if(d[ v[x][i] ]==-1)
        {
          q.push(v[x][i]);
          d[ v[x][i] ] = d[x]+1;
        }
     
     q.pop();
   }
   for(int i=1;i<=n;i++)out<<d[i]<<" ";
  return 0;
}