#include<bits/stdc++.h>

using namespace std;

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

int n , m , sef;

int main(){
    fin >> n >> m >> sef;
    vector<vector<int>> graf(n + 1);
    for(int i = 1 ; i <= m ; i++){
        int u , v; fin >> u >> v;
        graf[u].push_back(v);
    }
    vector<int> dist(n + 1 , -1);
    queue<int> q;
    q.push(sef);
    dist[sef] = 0;
    while(!q.empty()){
        int nod = q.front();
        q.pop();
        for(auto vecin : graf[nod]){
            if(dist[vecin] == -1){
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }
    for(int i = 1; i <= n ; i++) fout << dist[i] <<" ";
}