#include <bits/stdc++.h>
using namespace std;

vector<int> L[100'001];
int dist[100'001]; // noduri visitate

int n, m;

void bfs(int s) {
    queue<int> q;
    for(int i = 1; i <= n; i++) {
        dist[i] = 1e9; // insty
    }
    dist[s] = 0;
    q.push(s);
    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(int i = 0; i < L[nod].size(); i++) {
            int vecin = L[nod][i];
            if(dist[vecin] > dist[nod] + 1) {
                dist[vecin] = dist[nod] + 1;
                q.push(vecin);
            }
        }
    }

}

int main() {
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    int s;
    cin >> n >> m >> s;
    for(int i = 1; i <= m; i++) {
        int x, y; // citim muchia
        cin >> x >> y;
        L[x].push_back(y);
        // L[y].push_back(x);
    }
    bfs(s);
    for(int i = 1; i <= n; i ++) {
        if(dist[i] >= 1e9)
            cout << -1 << " ";
        else
            cout << dist[i] << " ";
    }
    return 0;
}