#include <bits/stdc++.h>

using namespace std;

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

int n, m, p, x, y;
vector<int> d;
vector<int> G[100005];

void bfs(int nod) {
    d.resize(n + 1, -1);
    d[nod] = 0;
    queue<int> Q;
    Q.push(nod);
    while(!Q.empty()) {
        nod = Q.front();
        Q.pop();
        for(auto i : G[nod]) {
            if(d[i] == -1) {
                d[i] = d[nod] + 1;
                Q.push(i);
            } else if(d[i] > d[nod] + 1) {
                d[i] = d[nod] + 1;
            }
        }
    }
}

int main() {
    fin >> n >> m >> p;
    for(int i = 1; i <= m; i++) {
        fin >> x >> y;
        G[x].push_back(y);
    }
    fin.close();
    bfs(p);
    for(int i = 1; i <= n; i++) {
        fout << d[i] << " ";
    }
    return 0;
}