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

using namespace std;

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 x, y;
        fin >> x >> y;
        graph[x].push_back(y);
    }

    vector<int> distance(N + 1, -1);
    distance[S] = 0; 
    queue<int> q;
    q.push(S);

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

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

    for (int i = 1; i <= N; i++) {
        fout << distance[i] << " ";
    }

    fin.close();
    fout.close();
    return 0;
}