#include <bits/stdc++.h>
using namespace std;
#define maxn 10010
ifstream in("bfs.in");
outstream out("bfs.out");
 
int L[maxn], C[maxn];
vector <int> A[maxn];
queue <int> neighbors;
void BFS(int node) {
    memset(C, -1, sizeof(C));
    C[node] = 0;
    neighbors.push(node);
    while (!neighbors.empty()) {
            int vertex = neighbors.front();
            neighbors.pop();
            for (int i = 0; i < L[vertex]; ++i) {
                    if (C[A[vertex][i]] == -1) {
                            neighbors.push(A[vertex][i]);
                            C[A[vertex][i]] = C[vertex] + 1;
                    }
            }
    }
}
int main() {
    int n, m, node;
    in >> n >> m >> node;
    for (int i = 1; i <= m; ++i) {
            int x, y;
            in >> x >> y;
            A[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i) {
            L[i] = A[i].size();
    }
    BFS(node);
    for (int i = 1; i <= n; ++i) {
            out << C[i] <<" ";
    }
}