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

vector<int> L[100001];
int dis[100001];

int n, m, s;

void bfs(int s) {
    for (int i = 1; i <= n; i++) {
        dis[i] = -1;
    }
    dis[s] = 0;
    queue<int> q;
    q.push(s);
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (auto vec: L[node]) {
            if (dis[vec] == -1) {
                dis[vec] = dis[node] + 1;
                q.push(vec);
            }
        }
    }
}

int main() {
    freopen("dfs.in", "r", stdin);
    freopen("dfs.out", "w", stdout);
    cin >> n >> m >> s;
    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;
        L[a].push_back(b);
    }
    bfs(s);
    for (int i = 1; i <= n; i++) cout << dis[i] << ' ';
}