#include <bits/stdc++.h>

using namespace std;

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

int main()
{
    int n, m, s;
    fin >> n >> m >> s;
    vector<vector<int>> adj(n + 1);
    for (int i = 0; i < m; i++) {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
    }
    vector<int> parent(n + 1, 0);
    vector<int> dist(n + 1, -1);
    
    queue<int> q;
    q.push(s);
    dist[s] = 0;
    parent[s] = -1;
    while (!q.empty()) {
        int current = q.front();
        q.pop();
        for (int node : adj[current]) {
            if (dist[node] == -1) {
                dist[node] = dist[current] + 1;
                parent[node] = current;
                q.push(node);
            }
        }
    }
    for (int i = 1; i <= n; i++)
        fout << dist[i] << " ";
    return 0;
}