#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const int ABC = 1e9 + 9;
std::vector <int> G[MAXN];
std::queue <int> q;
int dist[MAXN] ;
void initializerG(){
    for(int i = 1; i <= MAXN; ++i) dist[i] = ABC;
}
void bfs(int start){
    q.push(start);
    dist[start] = 0;
    while(q.size()){
        int node = q.front();
        q.pop();
        for(auto x: G[node]){
            if(dist[x] > dist[node] + 1){
                dist[x] = dist[node] + 1;
                q.push(x);
            }
        }
    }
}
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int main()
{
    int n, m, start;
    fin >> n >> m >> start;
    for(int i = 1; i <= m; ++i){
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    initializerG();
    bfs(start);
    for(int i = 1; i <= n; ++i){
        if(dist[i] >= ABC) dist[i] = -1;
        fout << dist[i] << " ";
    }
    return 0;
}