#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) {
    bool viz[nMax] = {};

    queue<pair<int, int>> q;
    q.push({s, 0});

    if (s == f){
        return 0;
    }

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

        for (auto x:v[curr.first]) {
            if (!viz[x]) {
                if (x == f) {
                    return curr.second + 1;
                } else {
                    viz[x] = true;
                    q.push({x, curr.second + 1});
                }
            }
        }
    }

    return -1;
}

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

    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;
}