#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int N, M, S;
vector<vector<int>>g;
vector<int>d;
void bfs(int S) {
    queue<int>q;
    q.push(S);
    d[S] = 0;
    while(!q.empty()) {
        int node = q.front();
        q.pop();
//        cout << node << '\n';
        for(auto it: g[node]) {
            if(d[it] == -1) {
                d[it] = d[node] + 1;
                q.push(it);
            }
        }
    }
}
int main() {
    fin >> N >> M >> S;
    d = vector<int>(N + 1, -1);
    g = vector<vector<int>>(N + 1);
    for(int i = 1, x, y; i <= M; i++) {
        fin >> x >> y;
        g[x].push_back(y);
    }
    bfs(S);
    for(int i =1; i <= N; i++) {
        fout << d[i] << " ";
    }
    fout << '\n';
    return 0;
}