#include <bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int N_MAX = 1e5 + 5;

int N, M, S;
int x, y;

vector < int > G[N_MAX];

int Ans[N_MAX];
void BFS(int S)
{
    queue < int > Q;
    Q.push(S);

    Ans[S] = 1;
    while (Q.size()) {
        int currNode = Q.front();
        Q.pop();

        for (int i = 0; i < G[currNode].size(); i++) {
            int node = G[currNode][i];
            if (Ans[node] == 0) {
                Ans[node] = Ans[currNode] + 1;
                Q.push(node);
            }
        }
    }
}

int main()
{
    fin >> N >> M >> S;
    for (int i = 1; i <= M; i++) {
        fin >> x >> y;
        G[x].push_back(y);
    }
    BFS(S);
    for (int i = 1; i <= N; i++) {
        fout << Ans[i] - 1 << " ";
    }
    return 0;
}