#include <bits/stdc++.h>
using namespace std;

ifstream fi("bfs.in");
ofstream fo("bfs.out");

int n, m, s;
vector<int> ad[100005];
int dist[100005];

void bfs(int start) {
  for (int i = 1; i <= n; i++)
    dist[i] = -1;

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

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

    for (int vecin : ad[nod]) {
      if (dist[vecin] == -1) {
        dist[vecin] = dist[nod] + 1;
        q.push(vecin);
      }
    }
  }
}

int main() {
  fi >> n >> m >> s;
  int x, y;
  for (int i = 1; i <= m; i++) {
    fi >> x >> y;
    ad[x].push_back(y);
  }

  bfs(s);

  for (int i = 1; i <= n; i++)
    fo << dist[i] << " ";
  fo << "\n";

  return 0;
}