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

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

const int N = 100005;
vector<int> G[N];
int dist[N];
int n, m, S;

void bfs(int start) {
    queue<int> q;
    for (int i = 1; i <= n; i++) {
        dist[i] = -1;
    }
    dist[start] = 0;
    q.push(start);

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

        for (int i = 0; i < G[nod].size(); i++) {
            int v = G[nod][i];
            if (dist[v] == -1) {
                dist[v] = dist[nod] + 1;
                q.push(v);
            }
        }
    }
}


int main() {
    fin >> n >> m >> S;

    for (int i = 1; i <= m; ++i) {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
        dist[i] = -1;

    bfs(S);

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

    fout << "\n";
    return 0;
}