#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

vector<int> bfs(const vector<vector<int>>& graph, int start)
{
    queue<int> q;
    q.push(start);
    vector<int> dist(graph.size(), -1);
    vector<bool> visited(graph.size());
    
    visited[start] = true;
    dist[start] = 0;
    
    while(!q.empty())
    {
        int node = q.front();
        q.pop();
        
        for(int neigh: graph[node])
        {
            if(visited[neigh]) continue;
            
            q.push(neigh);
            visited[neigh] = true;
            dist[neigh] = dist[node] + 1;
        }
    }
    
    return dist;
}

int main() 
{
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    int n, m, s;
    
    fin >> n >> m >> s;
    vector<vector<int>> graph(n + 1);
    for(int i = 0; i < m; i++)
    {
        int a, b;
        
        fin >> a >> b;
        graph[a].push_back(b);
    }
    
    vector<int> result = bfs(graph, s);
    
    for(int i = 1; i <= n; i++) {
        fout << result[i] << ' ';
    }
    
    return 0;
}