#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, int node_prec){
     visited[node] = visited[node_prec] + 1;
     for (int i = 0; i < G[node].size(); ++i){
          if (visited[G[node][i]] == -1){  
               BFS(G[node][i], node);
          }
     }
}

int main()
{
     // citire
     cin >> n >> m >> S;
     for (int i = 0; i < m; ++i)
     {
          cin >> x >> y;
          G[x].push_back(y);
     }
     
     // ne cream vectorul cu toate elementele nevizitate
     initializare_vizited(n);

     //cautam cel mai scurt drum de la nodul S
     BFS(S,S);
     for (int i = 1; i <= n; ++i){
          cout << visited[i] << ' ';
     }
     return 0;
}