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

using namespace std;

vector <int> v[100000];
queue <int> q;
int m,n,s,i,d[10000],x,y;


int main()
{ifstream f ("bfs.in");
f>>n>>m>>s;
for (i=1;i<=m;i++)
{
    v[x].push_back(y);
}
for (i=1;i<=n;i++)
    d[i]=-1;
d[s]=0;
q.push (s);
while (!q.empty())
{
  x=q.front();
  q.pop();
  for (i=1;i<=v[x].size();i++)
  {
      y=v[x][i];
      if (d[y]==-1)
      {
          q.push (y);
          d[y]=d[x]+1;
          }
  }
}
ofstream g ("bfs.out");
for (i=1;i<=n;i++)
    g<<d[i]<<" ";
    return 0;
}