#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n, m, s, x, y, d[100001];
vector<int> v[100001];
void bfs(int x){
    queue<int> coada;
    coada.push(x);
    while(!coada.empty()){
        x = coada.front();
        coada.pop();
        for(int i = 0; i < v[x].size(); i++)
            if(d[v[x][i]] == -1)
                coada.push(v[x][i]), d[v[x][i]] = d[x] + 1;
    }
}
int main(){
    fin >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        v[x].push_back(y);
    }
    memset(d, -1, sizeof(d));
    d[s] = 0;
    bfs(s);
    for(int i = 1; i <= n; i++)
        fout << d[i] << ' ';
    return 0;
}