#include <iostream>
#include <vector>
#include <queue>
#include <fstream>
using namespace std;
ifstream fin("grafin.txt");
ofstream fout("grafout.txt");

vector<int> gr[100000];
int main(int argc, const char * argv[]) {
  int n, m, s;
  fin >> n >> m >> s;
  for (int i = 1; i <= m; i++) {
    int x, y;
    fin >> x >> y;
    gr[x].push_back(y);
  }
  queue<int> q;
  int dist[n];
  for (int i = 0; i <= n; i++)
    dist[i] = -1;
  q.push(s);
  dist[s] = 0;
  while (!q.empty()) {
    int nod = q.front();
    q.pop();
    for (int i = 0; i < gr[nod].size(); i++) {
      if (dist[gr[nod].at(i)] == -1) {
        q.push(gr[nod].at(i));
        dist[gr[nod].at(i)] = dist[nod] + 1;
      }
    }
  }
  for (int i = 1; i <= n; i++)
    fout << dist[i] << " ";
}