#include <algorithm>
#include <climits>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>

using namespace std;

#define MAXN 100001

vector<int> g[MAXN];
int dist[MAXN];
int n, m, s;

int main() {
    // stuff
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");

    fin >> n >> m >> s;
    int x, y;
    for (int i = 1; i <= m; i++) {
        fin >> x >> y;
        g[x].push_back(y);
    }

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

    queue<int> q;
    q.push(s);
    dist[s] = 0;
    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (int &u : g[node]) {
            if (dist[u] == -1) {
                dist[u] = dist[node] + 1;
                q.push(u);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        cout << dist[i] << ' ';
    }
    cout << '\n';

    fin.close();
    fout.close();

    return 0;
}