#include <bits/stdc++.h>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s;

vector<int> g[100100];
int v[100100];

void bfs(int x){
    list<int> q;
    v[x] = 0;
    q.push_back(x);

    while(!q.empty()){
        x = q.front();
        q.pop_front();

        for(int i = 0; i<g[x].size(); i++){
            if(s!= g[x][i] && v[g[x][i]] == -1){
                v[g[x][i]] = v[x] + 1;
                q.push_back(g[x][i]);
            }
        }
    }


}

int main(){
    fin >> n >>m >> s;
    int x,y;
    for(int i = 0; i < m; i++){
        fin >> x>> y;
        g[x].push_back(y);
    }
    memset(v, -1, sizeof(v));
    bfs(s);

    for(int i = 1; i<=n; i++)
        fout << v[i] << " ";
    return 0;
}