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

using namespace std;

const int mxn = 100005;

int n ,m, l, start, cost[mxn];
vector <int> G[mxn];
queue <int> Q;

inline void bfs(){
    int varf;
    memset(cost, -1, sizeof(cost));
    Q.push(start);
    cost[start] = 0;
    while(not Q.empty()){
        varf = Q.front();
        Q.pop();
        for(vector<int>::iterator it = G[varf].begin(); it != G[varf].end(); ++it)
            if(cost[*it] == -1){
                cost[*it] = cost[varf] + 1;
                Q.push(*it);
            }
    }
}

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

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

    bfs();

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

    return 0;
}