#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream d("bfs.in");
ofstream o("bfs.out");
int i,a[100003],n,m,s,x,y,k;
int main()
{
  vector<int> v[100003];
  queue<int> q;
  d>>n>>m>>s;
  for (i=1;i<=m;i++) {d>>x>>y; v[x].push_back(y);};
  for (i=1;i<=m;i++) a[i]=-1;
  q.push(s);
  a[s]=0;
  while (!q.empty())
    {
      x=q.front();
      q.pop();
      k++;
      for (vector<int>::iterator it=v[x].begin();it != v[x].end();++it)
        {
        if (a[*it]==-1) {a[*it]=a[x]+1; q.push(*it);};
        };
    };
  for (i=1;i<=n;i++) {o<<a[i]<<' ';};
}