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

using namespace std;
ifstream fin("lab1/bfs.in");
ofstream fout("lab1/bfs.out");
const int MAXN = 100005;
vector<int> adj[MAXN];
int N,M,S;
int dist[MAXN];
void bfs(int s) {
    for (int i = 1; i <= N; ++i) {
        dist[i] = -1;
    }
    queue<int> q;
    dist[s] = 0;
    q.push(s);
    while (!q.empty()) {
        int curr = q.front();
        q.pop();

        for (int v : adj[curr]) {
            if (dist[v] == -1) {
                dist[v] = dist[curr] + 1;
                q.push(v);
            }
        }
    }
}
int main() {

    fin >> N >> M >> S;
    int x,y;
    for (int i = 0; i < M; i++) {
        fin >> x >>y;
        adj[x].push_back(y);
    }
    bfs(S);
    for (int i = 1; i <= N; ++i) {
        fout << dist[i] << " ";
    }
    fout << "\n";
    return 0;
}