// Source: https://usaco.guide/general/io

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

vector<int> L[100001];
int D[100001];

int main() {
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    int n, m, x;
    cin >> n >> m >> x;
    for(int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        L[x].push_back(y);
    }
    for(int i = 1; i <= n; i++) {
        if(i == x) {
            D[i] = 0;
        } else {
            D[i] = 1e9;
        }
    }
    queue<int> q;
    q.push(x);
    while(q.empty() == false) {
        int nod = q.front();
        q.pop();
        for(int i = 0; i < L[nod].size(); i++) {
            int vec = L[nod][i];
            if(D[vec] > D[nod] + 1) {
                D[vec] = D[nod] + 1;
                q.push(vec);
            }
        }
    }
    for(int i = 1; i <= n; i++) {
        if(D[i] == 1e9) {
            D[i] = -1;
        }
        cout << D[i] << ' ';
    }
}