#include <bits/stdc++.h>

using namespace std;

vector <int> mat[200005];
int dist[200005];
const int INF = 1e9;

void bfs(int n, int k) {
    for (int i = 1; i <= n; i++) {
        dist[i] = INF;
    }

    dist[k]=0;
    queue<int> q;
    q.push(k);
    while(!q.empty())
    {
        auto nodCrt=q.front();
        q.pop();
        for(auto vecin:mat[nodCrt])
            if(dist[vecin]>dist[nodCrt]+1){
                dist[vecin]=dist[nodCrt]+1;
                q.push(vecin);
        }
    }

    for (int i = 1; i <= n; i++) {
        if (dist[i] == INF)
            dist[i] = -1;
        cout << dist[i] << " ";
    }
}

int main() {
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        mat[x].push_back(y);
    }
    bfs(n, k);
}