#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

const int N = 100001;
int n, m, s, d[N];
vector <int> g[N];

int main() {
  freopen("bfs.in", "r", stdin);
  freopen("bfs.out", "w", stdout);

  scanf("%d %d %d", &n, &m, &s);
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d %d", &x, &y);
    g[x].push_back(y);
  }

  for (int i = 1; i <= n; i++)
    d[i] = -1;
  d[s] = 0;
  queue <int> q;
  q.push(s);

  while (!q.empty()) {
    s = q.front();
    q.pop();
    for (auto &t : g[s])
      if (d[t] == -1) {
        d[t] = 1 + d[s];
        q.push(t);
      }
  }

  for (int i = 1; i <= n; i++)
    printf("%d ", d[i]);
  printf("\n");
  return 0;
}