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

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

vector<int> L[100001];
int d[100001];
int n, m, s;

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

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

int main() {
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    
    in >> n >> m >> s;
    for (int i = 1; i <= m; i++) {
        int a,b ;
        in >> a >> b;
        L[a].push_back(b);
    }
    bfs();
    for (int i = 1; i <= n; i++) out << d[i] << ' ';
}