#include <fstream>
#include <queue>
#include <vector>

using namespace std;

ifstream f ("bfs.in");
ofstream g ("bfs.out");

int n, m, first;
int drum[100005];
bool used[100005];
queue < int > coada;
vector < int > a[100005];

void Solve ()
{
   coada.push(first);
    while (!coada.empty())
    {
        int nod = coada.front();
        int lg = a[nod].size() - 1;
        used[nod] = 1;
         for (int i=0; i<=lg; i++)
         {
             if (!used[a[nod][i]])
             {
                 drum[a[nod][i]] = drum[nod] + 1;
                 used[a[nod][i]] = 1;
                 coada.push(a[nod][i]);
             }
         }
        coada.pop();
    }
}

int main()
{
  f >> n >> m >> first;
  for (int i=1; i<=m; i++)
  {
      int x, y;
      f >> x >> y;
      a[x].push_back(y);
  }
  Solve();

  for (int i=1; i<=n; i++)
  {
      if (drum[i] == 0 && i != first)
        drum[i] = -1;

      g << drum[i] << " ";
  }
    return 0;
}