#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define ll long long
#define NMAX 100005
#define INF 1000000000
#define MOD 666013

int dist[NMAX];
vector<int> graph[NMAX];
bool viz[NMAX];
queue<int> q;

void bfs(int nod) {
    q.push(nod);
    viz[nod] = true;
    dist[nod] = 0;
    while (!q.empty()) {
        int point = q.front();
        for (int x: graph[point]) {
            if (!viz[x]) {
                dist[x] = dist[point] + 1;
                q.push(x);
                viz[x] = true;
            }
        }
        q.pop();
    }
}

int main() {
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int n, m, s;
    cin >> n >> m >> s;
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        graph[x].pb(y);
    }

    for (int i = 1; i <= n; i++) dist[i] = -1;

    for (int i = 1; i <= n; i++) {
        bfs(s);
        cout << dist[i] << " ";
    }
    return 0;
}