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

int main() {
  std::ifstream in("bfs.in");
  std::ofstream out("bfs.out");
  
  int n, m, s;
  in >> n >> m >> s;
  
  std::vector<std::vector<int>> graph;
  std::vector<bool> visited;
  std::vector<int> distance;
  graph.reserve(n);
  visited.reserve(n);
  distance.reserve(n);
  for (int i = 0; i < n; i++) {
    graph.push_back(std::vector<int>());
    visited.push_back(false);
    distance.push_back(-1);
  }
  
  for (int i = 0; i < m; i++) {
    int from, to;
    in >> from >> to;
    graph[from - 1].push_back(to);
  }
  
  visited[s - 1] = true;
  distance[s - 1] = 0;
  std::queue<int> q;
  q.push(s);
  while (!q.empty()) {
    int u = q.front();
    for (int v : graph[u - 1]) {
      if (!visited[v - 1]) {
        visited[v - 1] = true;
        distance[v - 1] = distance[u - 1] + 1;
        q.push(v);
      }
    }
    q.pop();
  }
  
  for (int d : distance) {
    out << d << " ";
  }
  
  return 0;
}