#include <iostream>
#include <list>
#include <queue>

using namespace std;

const int nMax = 100005;

int n, m, s;
list<int> v[nMax];

int bfs(int f) {
    int dist[nMax] = {};

    queue<int> q;
    q.push(s);
    dist[s] = 1;

    while (!q.empty()) {
        int curr = q.front();
        q.pop();

        if (curr == f) {
            return dist[curr] - 1;
        }

        for (auto x:v[curr]) {
            if (dist[x] == 0) {
                dist[x] = dist[curr] + 1;
                q.push(x);
            }
        }
    }

    return -1;
}

int main() {
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> m >> s;

    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        v[x].push_back(y);
    }

    for (int i = 1; i <= n; i++) {
        cout << bfs(i) << " ";
    }

    return 0;
}