#include <bits/stdc++.h>
#define oo 0x3f3f3f3f

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n, m, x, y, s;
vector<int> graf[100001];
int rez[100001];

struct node{
  int node, time;
};

void read()
{
  f>>n>>m>>s;
  for(int i = 1;i <= m;++i)
    f>>x>>y, graf[x].push_back(y);
}

void solve()
{
  for(int i = 1;i <= n;++i)
    rez[i] = -1;
  rez[s] = 0;

  queue<int> q;
  q.push(s);

  while(!q.empty())
  {
    int first = q.front();
    q.pop();

    for(vector<int>::iterator it = graf[first].begin();it != graf[first].end();++it)
      if(rez[*it] == -1)
        rez[*it] = rez[first] + 1, q.push(*it);
  }

  for(int i = 1;i <= n;++i)
    g<<rez[i]<<" ";
}



int main()
{
  read();
  solve();
  return 0;
}