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

using namespace std;


vector<vector<int>> G;
vector<int> distances;
int N, M, S;

void lee() {
    queue<int> Q;
    Q.push(S);
    distances[S] = 0;
    while(!Q.empty()) {
        int node = Q.front();
        Q.pop();
        for(auto neigh : G[node]) {
            if(distances[neigh] == -1) {
                distances[neigh] = distances[node] + 1;
                Q.push(neigh);
            }
        }
    }
}

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    cin >> N >> M >> S;

    G.resize(N + 1);
    distances.resize(N + 1);

    fill(distances.begin(), distances.end(), -1);

    for(int i = 1; i <= M; i++) {
        int x, y;
        cin >> x >> y;
        G[x].push_back(y);
    }

    lee();

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

    return 0;
}