#include <cstdio>
#include <vector>
#include <queue>

using namespace std;
vector<vector<int>> Graph;
vector<int> Dist;

void BFS(int k) {
  fill(Dist.begin(), Dist.end(), 0x3f3f3f3f);
  Dist[k] = 0;

  queue<int> Q;
  Q.push(k);
  while (!Q.empty()) {
    k = Q.front(); Q.pop();
    for (auto it : Graph[k])
      if (Dist[it] > Dist[k] + 1) {
	Dist[it] = Dist[k] + 1;
	Q.push(it);
      }
  }
  for (auto it : Dist)
    if (it >= 0x3f3f3f3f)
      printf("-1 ");
    else
      printf("%d ", it);
}

int main()
{
  freopen("bfs.in", "r", stdin);
  freopen("bfs.out", "w", stdout);

  int N, M, X;
  scanf("%d%d%d", &N, &M, &X);
  Graph.resize(N);
  Dist.resize(N);
  
  for (int i = 0; i < M; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    Graph[a - 1].emplace_back(b - 1);
  }

  BFS(X - 1);
  
}