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