#include <bits/stdc++.h>

using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");
const int NN=10001;

int n,m,s,v[NN],p[NN],a[NN][NN];
queue <pair<int, int> > q;

void bfs(int nod){
  q.push({nod,0});
  while(!q.empty()){
    int vf=q.front().first;
    int grd=q.front().second;
    v[vf]=grd;
    p[vf]=1;
    q.pop();
    for(int i=1;i<=n;i++){
      if(a[vf][i]==1 && p[i]==0)
        q.push({i,grd+1});
    }
  }
}

int main() {
  in>>n>>m>>s;
    int x,y;
  while(m--){
    in>>x>>y;
    a[x][y]=1;
  }
  bfs(s);
  for(int i=1;i<=n;i++){
    if(i==s)
      out<<0<<' ';
    else
      if(!v[i])
        out<<-1<<' ';
      else
        out<<v[i]<<' ';
  }
  return 0;
}