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

using namespace std;

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

int n, m, source;
vector<vector<int>> nodes;
vector<int> res;

void bfs(int start) {
  queue<int> q;
  vector<int> dist;
  dist.resize(n + 1, -1);
  dist[start] = 0;

  q.push(start);

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

    for (auto &neigh : nodes[curr]) {
      if (dist[neigh] == -1) {
        dist[neigh] = dist[curr] + 1;
        q.push(neigh);
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    fout << dist[i] << " ";
  }
  fout << '\n';
}

int main() {
  fin >> n >> m >> source;

  nodes.resize(n + 1);

  int x, y;
  for (int i = 1; i <= m; i++) {
    fin >> x >> y;
    nodes[x].push_back(y);
  }

  bfs(source);
}