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

#define MAX_N 100010

using namespace std;

vector <int> ad[MAX_N];
int dist[MAX_N], n, m, s;

void read() {
  int x, y;

  scanf("%d%d%d", &n, &m, &s);

  for(int i = 0; i < m; i ++) {
    scanf("%d%d", &x, &y);
    ad[x].push_back(y);
  }
}

void solve() {
  queue <int> q;
  int x;

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

  q.push(s);
  dist[s] = 0;

  while(!q.empty()) {
    x = q.front();
    for(int i = 0; i < ad[x].size(); i ++)
      if(dist[ad[x][i]] == -1) {
	q.push(ad[x][i]);
	dist[ad[x][i]] = dist[x] + 1;
      }

    q.pop();
  }
}

void write() {
  for(int i = 1; i <= n; i ++)
    printf("%d ", dist[i]);
  printf("\n");
}
int main() {

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

  read();
  solve();
  write();

  return 0;
}