#include <bits/stdc++.h>
#include <vector>
#define NMAX (int)(1e5 + 5)

using namespace std;

int n, m, s, x, y;
vector<int> g[NMAX];
queue<int> q;

struct node {
    bool visited;
    int dist;
} nodes[NMAX];

void BFS(int x) {
    nodes[x].visited = true;
    nodes[x].dist = 0;
    q.push(x);

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

        for (int next : g[curr])
            if (!nodes[next].visited) {
                nodes[next].visited = true;
                nodes[next].dist = nodes[curr].dist+1;
                q.push(next);
            }
    }
}

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

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

    for (int i = 1; i <= n; ++i)
        nodes[i].dist = -1;
    BFS(s);

    for (int i = 1; i <= n; ++i)
        printf("%d ", nodes[i].dist);
    printf("\n");

    return 0;
}