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

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

int n,m,s;

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

void bfs(int sursa) {
    for (int i= 1; i<=n; i++) {
        d[i] = -1;
    }
    d[sursa] = 0;
    queue<int> q;
    q.push(sursa);
    while (q.empty() == false) {
        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() {
    f>> n >> m >> s;
    for (int i=1; i<=m; i++) {
        int a,b;
        f>>a>>b;
        L[a].push_back(b);
    }

    bfs(s);
    for (int i=1; i<=n; i++)
        g<<d[i]<<" ";
    return 0;
}