#include <fstream>
#include <iostream>
#include <queue>
#include <vector>

using namespace std;

const int MAXN = 100001;

vector<int> adj[MAXN];
vector<int> dist;
int N, M, S;

void bfs(int start) {
  dist.assign(N + 1, -1);

  queue<int> q;
  q.push(start);
  dist[start] = 0;

  while (!q.empty()) {
    int current = q.front();
    q.pop();

    for (int next : adj[current]) {
      if (dist[next] == -1) {
        dist[next] = dist[current] + 1;
        q.push(next);
      }
    }
  }
}

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

  fin >> N >> M >> S;

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

  bfs(S);

  for (int i = 1; i <= N; i++) {
    fout << dist[i] << " ";
  }
  fout << "\n";

  fin.close();
  fout.close();
  return 0;
}