#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
#define Nmax 100005
using namespace std;
int n,Source;
bool viz[Nmax];
int Distance[Nmax];
queue<int> MY_QUEUE;
vector<int>Graph[Nmax];
vector<int>::iterator it;
void reading(int &n,int &Source)
{
     int m,x,y;
     freopen("bfs.in","r",stdin);
     freopen("bfs.out","w",stdout);
     scanf("%d %d %d",&n,&m,&Source);
     while(m)
     {
         --m;
         scanf("%d %d",&x,&y);
         Graph[x].push_back(y);
     }
}
void BFS()
{
   int i,Node;
   for(i=1;i<=n;++i) {viz[i]=false;Distance[i]=0;}
   viz[Source]=true;
   MY_QUEUE.push(Source);
   while(!MY_QUEUE.empty())
   {
       Node=MY_QUEUE.front();
       MY_QUEUE.pop();
       viz[Node]=true;
       for(it=Graph[Node].begin();it!=Graph[Node].end();++it)
          if (!viz[*it])
          {
                viz[*it]=true;
                MY_QUEUE.push(*it);
                Distance[*it]=Distance[Node]+1;
          }
   }
   for(i=1;i<=n;++i)
   if (Distance[i]) printf("%d ",Distance[i]);
   else if (!Distance[i] && i==Source) printf("%d ",0);
   else printf("%d ",-1);
}
int main()
{
    reading(n,Source);
    BFS();
    return 0;
}