#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

vector<int> G[100005], viz;
queue<int> q;

int main() {
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    int n, m, s, u, v;
    scanf("%d%d%d", &n, &m, &s);

    for(int i = 1; i <= m; ++ i) {
        scanf("%d%d", &u, &v);
        G[u].push_back(v);
    }

    viz.assign(n + 1, -1);
    q.push(s);
    viz[s] = 0;

    while(!q.empty()) {
        u = q.front();

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

        q.pop();
    }

    for(int i = 1; i <= n; ++ i) {
        printf("%d ", viz[i]);
    }

    return 0;
}