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

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

const int maxn = 1e5;
vector<int> adj[maxn + 1];
int dist[maxn + 1];

void bfs(int start) {
    dist[start] = 1;
    queue<int> coada;
    coada.push(start);
    while (!coada.empty()) {
        int current = coada.front();
        coada.pop();
        for (int child: adj[current])
            if (dist[child] == 0) {
                dist[child] = dist[current] + 1;
                coada.push(child);
            }
    }
}

int main() {
    int n, m, s;
    fin >> n >> m >> s;
    for (int i = 0; i < m; i++) {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
    }

    bfs(s);
    for (int i = 1; i <= n; i++)
        fout << dist[i] - 1 << ' ';
    fout << '\n';
    
    return 0;
}