#include <bits/stdc++.h>
#include <fstream>

using namespace std;

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

int n, m, s;

void bfs(vector<vector<int>> &adj, vector<int> &dist, int source) {
    queue<int> q;

    q.push(source);
    dist[source] = 0;

    while (!q.empty()) {
        int node = q.front();
        q.pop();

        for (auto neigh : adj[node]) {
            if (dist[neigh] == -1) {
                dist[neigh] = dist[node] + 1;
                q.push(neigh);
            }
        }
    }

}

int main() {
    in >> n >> m >> s;
    vector<vector<int>> adj(n + 1, vector<int>());
    vector<int> dist(n + 1, -1);

    for (int i = 1, x, y; i <= m; i++) {
        in >> x >> y;
        adj[x].push_back(y);
    }

    bfs(adj, dist, s);

    for (int i = 1; i <= n; i++)
        out << dist[i] << ' ';
}