#include <bits/stdc++.h>

const int MAX_N = 100005;
const int INF = (1 << 25);

int n, m, k;

std::vector <int> g[MAX_N];
std::vector <int> distances(MAX_N, INF);

void bfs(int node) {
  distances[node] = 0;
  std::queue <int> q;
  q.push(node);
  while (q.size() > 0) {
    int u = q.front();
    for (int v : g[u]) {
      if (distances[v] > distances[u] + 1) {
        distances[v] = 1 + distances[u];
        q.push(v);
      }
    }
    q.pop();
  }
}

int main() {
  int u, v;
  freopen("bfs.in", "r", stdin);
  freopen("bfs.out", "w", stdout);
  scanf("%d %d %d", &n, &m, &k);
  while (m --) {
    scanf("%d %d", &u, &v);
    g[u].push_back(v);
  }
  bfs(k);
  for (int i = 1; i <= n; ++i) {
    if (distances[i] == INF) {
      distances[i] = - 1;
    }
    printf("%d ", distances[i]);
  }
  return 0;
}