#include <bits/stdc++.h>
using namespace std;

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

vector<vector<int>> G;

vector<int> bfs(int start, int n) {
    vector<int> dist(n + 1, -1);
    vector<int> q;
    dist[start] = 0;
    q.push_back(start);
    int st = 0;
    while (st < q.size()) {
        int nod = q[st++];
        for (int vecin : G[nod]) {
            if (dist[vecin] == -1) {
                dist[vecin] = dist[nod] + 1;
                q.push_back(vecin);
            }
        }
    }
    return dist;
}

int main() {
    int n, m, s;
    fin >> n >> m >> s;
    G.resize(n + 1);
    for (int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    vector<int> dist = bfs(s, n);
    for (int i = 1; i <= n; i++) {
        fout << dist[i] << " ";
    }
    return 0;
}