#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s, x, y, dist[100005];
bool fv[100005];
vector <int> v[100005];
queue <int> q;

void bfs() {
    int nr = 2;
    dist[s] = 1;
    while (!q.empty()) {
        int el = q.front();
        for (int i = 0; i < v[el].size(); ++i) {
            if (fv[v[el][i]] == 1)
                continue;
            dist[v[el][i]] = dist[el] + 1;
            fv[v[el][i]] = 1;
            q.push(v[el][i]);
        }
        q.pop();
    }
    return;
}

int main() {
    fin >> n >> m >> s;
    while (m--) {
        fin >> x >> y;
        v[x].push_back(y);
    }
    q.push(s);
    fv[s] = 1;
    bfs();
    for (int i = 1; i <= n; ++i)
        fout << dist[i] - 1 << " ";
    return 0;
}