#include <iostream>   
#include <fstream>    
#include <stdlib.h>    
#include <queue>    
#include <list>    
#include <vector> 
   
#define MAX_NODES 100011     
using namespace std;
    
void addEdge(vector<int> list_gr[], int src, int dest) { 
    list_gr[src].push_back(dest);  
    
} 
      
void printGraph(vector<int> list_gr[], int vertices) { 
    
    for (int i = 1; i <= vertices; ++i) { 
        cout << "modul " << i << ":"; 
        for (auto x : list_gr[i]) {
           cout << " " << x;
        }
        printf("\n");     
    }   
}
    
void bfs_graph(vector<int> list_gr[], int vertices, int src, int *visited, int *distance) {   
    queue <int> q;  
    int i, parent;
    
        
    for (i = 1; i <= vertices; ++i) {
        visited[i] = 0;
        distance[i] = -1;
    }
    visited[src] = 1;
    distance[src] = 0;
    q.push(src);
    
    while (!q.empty()) {
        parent = q.front();
        q.pop();
    
        for (auto cnt : list_gr[parent]) {
           if (visited[cnt] == 0) {
               visited[cnt] = 1;
               distance[cnt] = distance[parent] + 1;
               q.push(cnt);
           }
        }
    }
}
    
int main() {    
    ifstream fisin("bfs.in");  
    ofstream fisout("bfs.out");
      
    int vertices, edges, S;
    int sur, des;
      
    fisin>> vertices >> edges >> S;  
    vector<int> list_gr[vertices+1]; 

    int visited[vertices+1], distance[vertices+1];

    for (int i = 0; i < vertices; ++i) {
        fisin>> sur >> des;
        addEdge(list_gr, sur, des);
    }

    for (i = 1; i <= vertices; i++) {
        visited[i] = 0;
        distance[i] = -1;
    }
    
    bfs_graph(list_gr, vertices, S, visited, distance);
    for (int i = 1; i <= vertices; ++i) {
        fisout << distance[i] << ' ';
    }
    
    fisout.close();    
    fisin.close();
    return 0; 
    
}