#include<fstream>
#include <vector>
using namespace std;
int viz[100005],n,m,x,y,cont=1,c[10000];
double long k,cost[10000];
vector <int> A[10000];
 ofstream g("bfs.out");
void citire()
{
     ifstream f("bfs.in");
     int x,y,i;
     f>>n>>m>>k;
     int l;
     for(l=1;l<=m;l++)
      {
          f>>x>>y;
          A[x].push_back(y);
        
          }
          f.close();
}
       
           void bfs(int k)
           {
                int li,ls,i,nr_vecini,nod;
                li=1;
           ls=1;
              c[li]=k;
               viz[k]=1;
               
               
               while (li<=ls)
                {nod=c[li];
                     nr_vecini=A[nod].size();
                  for(i=0;i<nr_vecini;i++)
                     if (viz[A[nod][i]]==0)
                          {ls++;  
                            c[ls]=A[nod][i];
                            viz[A[nod][i]]=1;
                            cost[A[nod][i]]=cost[nod]+1;
                            }
                  li++;
                  }
                
                  } 
              
              
                 
                 
       int main()
       {int i;
          
           citire();
           bfs(k);
          for(i=1;i<=n;i++)
            if (cost[i]!=0||i==k) g<<cost[i]<<" "; 
            else g<<-1<<" ";
          
                         
                        
                         g.close();
                         return 0;
                         }