#include <iostream>
#include <vector>
#include <queue>
#include <fstream>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

vector<int> L[1000001];
int d[1000001];
int n, m, s;
const int INF = 1e9;

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

    d[sursa] = 0;
    queue<int> q;
    q.push(sursa);
    while(!q.empty()) {
        int node = q.front();
        q.pop();
        for(auto vec: L[node]) {
            if(d[vec] > d[node] + 1){ // d[vec] == INF
                d[vec] = d[node] + 1;
                q.push(vec);
            }
        }
    }
}

int main() {

    f >> n >> m >> s;
    for(int i = 1; i <= m; i++) {
        int x, y;
        f >> x >> y;
        L[x].push_back(y);
        // L[y].push_back(x);
    }

    bfs(s);

    for( int i = 1; i <= n; i ++){
        if(d[i] == INF) {
            d[i] = -1;
        }
        g << d[i] << ' ';
    }
}