#include <fstream>
#include <vector> 

using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

vector <int> G[100005];

int n, m, x, y, S;
int visited[100005];

void initializare_vizited(int n){
     for (int i = 1; i <= n; ++i){
          visited[i] = -1;
     }
}

void BFS(int node){
     for (int i = 0; i < G[node].size(); ++i){
          if (visited[G[node][i]] == -1){  
               visited[G[node][i]] = visited[node] + 1;
               BFS(G[node][i]);
          }
     }
}

int main()
{
     // citire
     cin >> n >> m >> S;
     for (int i = 0; i < m; ++i)
     {
          cin >> x >> y;
          G[x].push_back(y);
     }
     initializare_vizited(n);
     visited[S] = 0;
     //cautare cel mai scurt drum/inexistent de la nodul S
     BFS(S);
     for (int i = 1; i <= n; ++i){
          cout << visited[i] << ' ';
     }
     return 0;
}