#include <fstream>
#include <deque>
#include <vector>

using namespace std;

int N,M;
int S;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

struct Nod
{
  vector <int> Ad;

  int dist=0;
};

Nod A[100001];

void Read()
{
  fin>>N>>M;
  fin>>S;

  int x,y;

  for(int i=1; i<=M; ++i)
  {
    fin>>x>>y;

    A[x].Ad.push_back(y);
  }

  fin.close();
}

void BFS()
{
   A[S].dist=1;

   deque <int> mata;

   mata.push_back(S);

   int curent;

   while(!mata.empty())
   {
     curent=mata.front(); mata.pop_front();

     for(int i=0; i<A[curent].Ad.size(); ++i)
       if(A[A[curent].Ad[i]].dist==0)
       {
         A[A[curent].Ad[i]].dist=A[curent].dist+1;
         mata.push_back(A[curent].Ad[i]);
       }
   }
}

void Print()
{
  for(int i=1; i<=N; ++i)
    fout<<A[i].dist-1<<' ';

  fout.close();
}

int main()
{
    Read();
    BFS();
    Print();

    return 0;
}