#include <bits/stdc++.h>
using namespace std;

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

vector<int> L[1000001];
int d[1000001];
int n;

void bfs(int sursa){
    for(int i = 1; i <= n; i++){
        d[i] = -1;
    }

    d[sursa] = 0;
    queue<int> q;
    q.push(sursa);

    while(q.empty() == false){
        int node = q.front();
        q.pop();
        for(auto vec : L[node]){
            if(d[vec] == -1){
                d[vec] = d[node] + 1;
                q.push(vec);
            }
        }
    }
}

int main(){
    int m, s;
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        int a, b;
        fin >> a >> b;
        L[a].push_back(b);
    }
    bfs(s);
    for(int i = 1; i <= n; i++)
        fout << d[i] << ' ';
    
    return 0;
}