#include <bits/stdc++.h>

using namespace std;

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

const int NMax = 1e5 + 5;

int v[NMax];

deque < int > Q;
vector < int > G[NMax];

inline void BFS(int node){
    vector < int > ::iterator it;
    Q.push_back(node);
    v[node] = 0;
    while(!Q.empty()){
        node = Q.front();
        Q.pop_front();
        for(it = G[node].begin(); it != G[node].end(); it++){
            if(v[*it] == -1){
                v[*it] = v[node] + 1;
                Q.push_back(*it);
            }
        }
    }
}

int main(){
    int n, m, x, y, s;
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        G[x].push_back(y);
    }
    memset(v, -1, sizeof(v));
    BFS(s);
    for(int i = 1; i <= n; i++){
        fout << v[i] << " ";
    }
    return 0;
}