#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

vector<vector<int>> G;
vector<int> D;

void bfs(int node) {
    queue<int> Q;
    Q.push(node);
    D[node] = 0;
    while(!Q.empty()) {
        int node = Q.front();
        Q.pop();
        for(auto neigh : G[node]) {
            if(D[neigh] == -1) {
                Q.push(neigh);
                D[neigh] = 1 + D[node];
            }
        }
    }
}

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

    int N, M, S;
    scanf("%d %d %d", &N, &M, &S);

    G.resize(N + 1);
    D.resize(N + 1);

    fill(D.begin(), D.end(), -1);

    for(int i = 1; i <= M; i++)
    {
        int nod, dest;
        scanf("%d %d", &nod, &dest);
        G[nod].push_back(dest);
    }

    bfs(S);

    for(int i = 1; i < D.size(); i++) {
        printf("%d ", D[i]);
    }

    return 0;
}