#include<fstream>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int viz[100005],n,m,x,y,cont=1;
queue <int> q;
double long k,cost[100001];
vector <int> A[100001];
 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 i,nr_vecini,nod;

              q.push(k);
               viz[k]=1;

while(!q.empty())

                {nod=q.front();
                     nr_vecini=A[nod].size();
                  for(i=0;i<nr_vecini;i++)
                     if (viz[A[nod][i]]==0)
                          {
                            q.push(A[nod][i]);
                            viz[A[nod][i]]=1;
                            cost[A[nod][i]]=cost[nod]+1;
                            }
                  q.pop();
                  }

                  }




       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<<" ";
       }