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