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

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

int n, m, i, x, y, nodStart;
vector < int > muchii[100005];
int distanta[100005];
queue < int > coada;

void BFS() {
  int nod, vecin;
  while (!coada.empty()) {
    nod = coada.front();
    coada.pop();

    for (unsigned int i = 0; i < muchii[nod].size(); i++) {
      vecin = muchii[nod][i];
      if (distanta[vecin] == -1) {
        distanta[vecin] = distanta[nod] + 1;
        coada.push(vecin);
      }
    }
  }
}

int main() {
  fin >> n >> m >> nodStart;
  for (i = 1; i <= m; i++) {
    fin >> x >> y;
    muchii[x].push_back(y);
  }

  for (i = 1; i <= n; i++)
    distanta[i] = -1;

  distanta[nodStart] = 0;

  coada.push(nodStart);

  BFS();

  for (i = 1; i <= n; i++)
    fout << distanta[i] << " ";
}