#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

    int N, M, S;
    fin >> N >> M >> S;

    vector<vector<int>> g(N + 1);  

    for (int i = 0; i < M; i++) {
        int x, y;
        fin >> x >> y;
        g[x].push_back(y); 
    }

    vector<int> dist(N + 1, -1); 
    queue<int> q;

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

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

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

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

    return 0;
}