#include <bits/stdc++.h>

using namespace std;

const int nmax = 100000;
vector <int> a[nmax + 1];
int d[nmax + 1];

void bfs(int x0){
    queue <int> q;
    fill(d, d + nmax + 1, -1);
    q.push(x0);
    d[x0] = 0;
    while(!q.empty()){
        int x = q.front();
        q.pop();
        for(auto y : a[x]){
            if(d[y] == -1){
                q.push(y);
                d[y] = 1 + d[x];
            }
        }
    }
}

int main(){
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    int n, m, s, x, y;
    cin >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        cin >> x >> y;
        a[x].push_back(y);
    }
    bfs(s);
    for(int i = 1; i <= n; i++){
        cout << d[i] << " ";
    }
    return 0;
}