#include <bits/stdc++.h>


using namespace std;

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

vector<int> v[100001];
int n, m;
int ans[100001];


void afisare () {
    for(int i = 1;  i <= n; ++ i)
        out << ans[i] << ' ';
}

// BFS
void bfs(int sp) {
    queue<int> q;
    q.push(sp);

    while(!q.empty()) {
        int nod_current = q.front();
        q.pop();
        for(auto vecin: v[nod_current]) {
            if(ans[vecin] == -1) {
                ans[vecin] = ans[nod_current] + 1;
                q.push(vecin);
            }
        }
    }
}

int main() {
    int t;


    afisare();


    in >> n >> m >> t;

    for(int i = 0; i < m ; ++ i) {
        int x, y;
        in >> x >> y;
        v[x].push_back(y) ;
        //v[y].push_back(x);
    }

    for(int i = 0; i <= n; ++ i)
        ans[i] = -1;

    ans[t] = 0;
    bfs(t);

    afisare();

    return 0;
}