#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

queue <int> q;
vector <int> G[100005];
vector <int> viz;

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

    int n, m, s, x, y, ed, v;

    scanf("%d%d%d", &n, &m, &s);

    for(int i = 1; i <= m; ++ i) {
        scanf("%d%d", &x, &y);
        G[x].push_back(y);
    }

    viz.assign(n + 1, -1);
    q.push(s);
    viz[s] = 0;

    while(!q.empty()) {
        s = q.front();
        ed = G[s].size();
        for(int j = 0; j < ed; ++ j) {
            v = G[s][j];
            if(viz[v] == -1) {
                viz[v] = viz[s] + 1;
                q.push(v);
            }
        }
        q.pop();
    }

    for(int i = 1; i <= n; ++ i)
        printf("%d ", viz[i]);

    return 0;
}