#include <iostream>
#include <cstdio>

using namespace std;

int lst[100001], q[100001], d[100001];
int vf[2000001], urm[2000001], nr;

void adauga(int x, int y) {
  nr++;
  vf[nr]=y;
  urm[nr]=lst[x];
  lst[x]=nr;
}

void bfs(int s) {
  int i, st, dr, x, y, p;
  for(i=1;i<=100001;i++)
    d[i]=-1;
  st=0;
  dr=0;
  q[dr]=s;
  d[s]=0;
  while(st<=dr) {
    x=q[st++];
    for(p=lst[x];p!=0;p=urm[p]) {
      y=vf[p];
      if(d[y]==-1) {
        q[++dr]=y;
        d[y]=d[x]+1;
      }
    }
  }
}

int main() {
  FILE *fin, *fout;
  int n, m, s, i, a, b;
  fin=fopen("bfs.in","r");
  fout=fopen("bfs.out","w");
  fscanf(fin, "%d%d%d",&n,&m,&s);
  for(i=1;i<=m;i++) {
    fscanf(fin, "%d%d",&a,&b);
    adauga(a,b);
  }
  bfs(s);
  for(i=1;i<=n;i++)
    fprintf(fout, "%d ",d[i]);
  fclose( fin );
  fclose( fout );
  return 0;
}