#include <bits/stdc++.h>

using namespace std;
#define inf 1e9

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

int main(){
    int n, m, s;
    fin >> n >> m >> s;

    vector<vector<int>> graf(n+1);
    for(int i = 1; i<=m; i++){
        int u, v; fin >> u >> v;
        if(u != v){
            graf[u].push_back(v);
        }
    }
    queue<int> q;
    vector<int> vis(n+1, false);
    vector<int> d(n+1, inf);
    q.push(s);
    d[s] = 0;
    while(!q.empty()){
        int node = q.front();
        q.pop();
        for(auto adj : graf[node]){
            if(!vis[adj]){
                vis[adj] = 1;
                d[adj] = min(d[adj], d[node] + 1);
                q.push(adj);
            }
        }
    }
    for(int i = 1; i<=n; i++){
        if(d[i] == inf){
            fout << -1 << " ";
        } else {
            fout << d[i] << " ";
        }
    }
}