#include <bits/stdc++.h>

using namespace std;

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

int n,m,s,v[NN],x,y;
queue <int>q;
vector <int>a[NN];


void bfs(int nod){
  q.push(nod);
  v[s]=0;
  while(!q.empty()){
    int vf=q.front();
    q.pop();
    for(int i=0;i<a[vf].size();i++){
      int vec=a[vf][i];
      if(v[vec]==-1){
        q.push(vec);
        v[vec]=v[vf]+1;
    }
    }
  }
}

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