#include <fstream>
#define NMAX 100000
#include <vector>
#include <queue>

using namespace std;

int dist[NMAX + 1];
queue <int> q;
vector <int> v[NMAX + 1];

int n, m;
int x, y;
int snod;
int nextnod;
int d;

void bfs(int node){
  q.push(node);
  dist[node] = 1;

  while (!q.empty()){
    snod = q.front();
    d = dist[snod];
    q.pop();

    for (int i = 0; i < v[snod].size(); i++){
      nextnod = v[snod][i];
      if (dist[nextnod] == 0){
        dist[nextnod] = d + 1;
        q.push(nextnod);
      }
    }
  }
}
int main(){

  ifstream fin ("bfs.in");
  ofstream fout ("bfs.out");
  int node;
  fin >> n >> m >> node;

  for (int i = 0; i < m; i++){
    fin >> x >> y;
    v[x].push_back(y);
  }

  bfs (node);
  for (int i = 1; i <= n; i++)
    fout << dist[i] - 1 << " ";
  return 0;
}