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

using namespace std;


int main() {
    ifstream in("bfs.in");
    ofstream of("bfs.out");
    int N=0, M, S;
    in >> N >> M >> S;
    vector<int> G[N + 1];

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

    int d[N + 1] = {-1};
    int viz[N + 1] = {0};

    queue<int> q;
    q.push(S);
    viz[S] = 1;

    while (!q.empty()) {
        int next = q.front();
        q.pop();
        for (auto v : G[next]) {
            if (viz[v] == 0) {
                q.push(v);
                viz[v] = 1;
                d[v] = d[next] + 1;

            }
        }
    }

    for (int i = 1; i <= N; ++i) {
        if(d[i]==0 && i != S){
            d[i]=-1;
        }
        of << d[i] << " ";
    }

    return 0;
}