#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

int n, m, vizitat[105];
vector <int> graf[105];
queue <int> coada;

void BFS(int nod) {
    vizitat[nod] = 1;
    coada.push(nod);
    while (coada.empty() == 0) {
        nod = coada.front();
        coada.pop();
        for (int i = 0; i < graf[nod].size(); i++) {
            if (vizitat[graf[nod][i]] == 0) {
                vizitat[graf[nod][i]] = vizitat[nod] + 1;
                coada.push(graf[nod][i]);
            }
        }
    }
}

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    int X, x, y;
    scanf("%d%d%d", &n, &m, &X);
    for (int i = 0; i < m; i++) {
        scanf("%d%d", &x, &y);
        graf[x].push_back(y);
    }

    BFS(X);

    for (int i = 1; i <= n; i++) {
        printf("%d ", vizitat[i] - 1);
    }
    return 0;
}