#include <bits/stdc++.h>

#define NMAX 100001

using namespace std;

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

int dist[NMAX];
vector<int> graph[NMAX];
queue<int> q;

int main()
{
  int n,m,s;
  fin >> n >> m >> s;
  while(m--)
  {
    int x, y;
    fin >> x >> y;
    graph[x].push_back(y);
  }
  for(int i = 1; i <= n; i++) dist[i] = -1;
  q.push(s);
  dist[s] = 0;
  while(!q.empty())
  {
    int node = q.front();
    q.pop();
    for(auto x : graph[node])
    {
      if(dist[x] == -1)
      {
        dist[x] = dist[node]+1;
        q.push(x);
      }
    }
  }

  for(int i = 1; i <= n; i++) fout << dist[i] << ' ';
  fin.close();
  fout.close();

  return 0;
}