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

using namespace std;

void BFS(int s, vector<vector<int>>& adj, vector<int>& dist) {
    int node;

    dist[s] = 0;

    queue<int> q;
    q.push(s);

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

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

int main() {
    int x, y, i, n, m, s;

    ifstream f("bfs.in");
    ofstream g("bfs.out");
    f >> n >> m >> s;

    vector<vector<int>> adj(n + 1);
    vector<int> dist(n + 1, -1);
    for (i = 1; i <= m; ++i) {
        f >> x >> y;
        adj[x].push_back(y);
    }

    BFS(s, adj, dist);

    for (i = 1; i <=n; ++i) {
        g << dist[i] << ' ';
    }

    f.close();
    g.close();

    return 0;
}