#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

#define DIM 100001

vector <int> v[DIM];
int n, m, nod, sel[DIM], x, y;

static inline void reset() {
    for(int i = 1; i <= n; i++)
        sel[i] = 0;
}

static inline int bfs(int sf) {
    queue<pair<int, int>> q;
    int pasi = -1, nr = 0, k;

    sel[nod] = 1;
    q.push({nod, nr});
    while(!q.empty()) {
        k = q.front().first;
        nr = q.front().second;
        q.pop();

        if(k == sf) {
            pasi = nr;
            break;
        }

        for(auto e : v[k])
            if(sel[e] == 0) {
                sel[e] = 1;
                q.push({e, nr + 1});

            }
    }
    reset();

    return pasi;
}

int main() {
    cin >> n >> m >> nod;
    for(int i = 1; i <= m; i++) {
        cin >> x >> y;
        v[x].push_back(y);
    }

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

    return 0;
}