#include <cstdio>
#include <vector>
#include <queue>
#define INF 1000
using namespace std;

int main() {
    int n, m, S, x, y, d[100005], nod, vecin, i;
    bool v[100005] {};
    vector<int> G[100005];
    queue<int> q;
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    scanf("%d%d%d", &n, &m, &S);
    for(i = 1; i <= m; ++i) {
        scanf("%d%d", &x, &y);
        G[x].push_back(y);
    }
    for(i = 1; i <= n; ++i)
        d[i] = INF;

    d[S] = 0;
    q.push(S);
    v[S] = 1;

    while(!q.empty()) {
        nod = q.front();
        q.pop();
        for(i = 0; i < G[nod].size(); ++i) {
            vecin = G[nod][i];
            if(d[vecin] > d[nod] + 1)
                d[vecin] = d[nod] + 1;
                if(v[vecin] == 0) {
                    q.push(vecin);
                    v[vecin] = 1;
                }
        }
    }

    for(i = 1; i <= n; ++i)
        if(d[i] == INF)
            printf("-1 ");
        else
            printf("%d ", d[i]);
}