#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5+2;
int n,m,s,dist[NMAX];
vector<int> v[NMAX];

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int main() {
  fin >> n >> m >> s;
  for(int i = 1; i <= m; i++){
    int x, y;
    fin >> x >> y;
    v[x].push_back(y);
  }
  for(int i = 1; i <= n; i++){
    dist[i] = NMAX;
  }
  deque<int> dq;
  dq.push_back(s);
  dist[s] = 0;
  while(!dq.empty()){
    int nod = dq.back();
    dq.pop_back();
    for(int vecin: v[nod]){
      if(dist[vecin] > dist[nod]+1){
        dist[vecin] = dist[nod]+1;
        dq.push_front(vecin);
      }
    }
  }
  for(int i = 1; i <= n; i++){
    fout << (dist[i] == NMAX ? -1 : dist[i]) << " ";
  }
  return 0;
}