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

using namespace std;

int noduri, muchii, sursa, x, y, grad[100001];
vector<int>vec[100001];
queue<int>q;

void bfs(int nod) {
  vector<int>::iterator i;

  q.push(sursa);
  while (!q.empty()) {
    int nodc = q.front(); q.pop();
    for (i = vec[nodc].begin(); i < vec[nodc].end(); i++)
      if (!grad[*i])
        q.push(*i), grad[*i] = grad[nodc]+1;
  }
}

int main () {
  ifstream fi("bfs.in");
  ofstream fo("bfs.out");
  fi >> noduri >> muchii >> sursa;
  for (int i = 1; i <= muchii; i++)
    fi >> x >> y, vec[x].push_back(y);
  grad[sursa] = 1; bfs(sursa);
  for (int i = 1; i <= noduri; i++)
    grad[i] ? fo << grad[i]-1 << ' ' : fo << "-1 ";
  return 0;
}