#include <iostream>
#include <fstream>
#define MAX 1000005
#define MAX2 100005
using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
int x,y,m,n,s,i,j,r[MAX],c[MAX2],v[MAX2],inc,sf,z,last[MAX2],first[MAX2];
struct muchie
{
    int x,y;
}a[MAX];
void QUICKSORT(int inf,int sup)
{
  int x,i,j;
  i=inf;
  j=sup;
  x=a[(i+j)/2].x;
  do{
    while ((i<sup)&&(a[i].x<x)) i++;
    while ((j>inf)&&(a[j].x>x)) j--;
    if (i<=j)
    {
      a[0]=a[i];
      a[i]=a[j];
      a[j]=a[0];
      i++;
      j--;
    }
  }while (i<=j);
  if (inf<j) QUICKSORT(inf,j);
  if (i<sup) QUICKSORT(i,sup);
}
int main()
{
    f>>n>>m>>s;
    for (i=1;i<=n;i++) v[i]=-1;
    v[s]=0;
    for (i=1;i<=m;i++)
    {
        f>>a[i].x>>a[i].y;
        if (first[a[i].x]==0)
            first[a[i].x]=last[a[i].x]=i;
        else
        {
            r[last[a[i].x]]=i;
            last[a[i].x]=i;
        }
    }
    c[0]=s;
    while (inc<=sf)
    {
        x=c[inc++];
        y=first[x];
        while (y!=0)
        {
            if (v[a[y].y]==-1)
            {
                v[a[y].y]=v[x]+1;
                c[++sf]=a[y].y;
            }
            y=r[y];
        }
    }
    for (i=1;i<=n;i++)
        g<<v[i]<<' ';
    return 0;
}