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

vector<int> adj[100005];
int dist[100005];

void bfs(int s) {
    queue<int> q;
    q.push(s);
    dist[s] = 0;
    while(!q.empty()) {
        int top = q.front();
        q.pop();

        for(auto& i : adj[top]) {
            if(dist[i] == -1) {
                q.push(i);
                dist[i] = dist[top] + 1;
            }
        }
    }
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
#ifndef LOCAL
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
#endif

    int n, m, s; cin >> n >> m >> s;
    for(int i = 1; i <= m; ++i) {
        int x, y; cin >> x >> y;
        adj[x].push_back(y);
    }

    fill(dist + 1, dist + 100001, -1);
    bfs(s);

    for(int i = 1; i <= n; ++i) {
        cout << dist[i] << ' ';
    }

    return 0;
}