#include <bits/stdc++.h>

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

int n, m, s;
std::vector<int> nb[100001]; //vecinii
std::vector<int> dist(100001, -1);

void bfs(int node)
{
    std::queue<int> q;
    int node2, j, neighbor;
    q.push(node);
    dist[node] = 0;
    while(!q.empty()){
        node2 = q.front();
        q.pop();
        for(j = 0; j < nb[node2].size(); j++){
            neighbor = nb[node2][j];
            if(dist[neighbor] == -1){
                dist[neighbor] = 1 + dist[node2];
                q.push(neighbor);
            }
        }
    }
}



int main()
{
    int i = 0, x, y;
    fin >> n >> m >> s;
    for(i = 0; i < m; i++){
        fin >> x >> y;
        nb[x].push_back(y);
    }
    bfs(s);
    for(i = 1; i <= n; i++)
        fout << dist[i] << " ";

    return 0;
}