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

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

std::vector<std::vector<int>> adj;
std::vector<int> dist;

void BFS(int s) {
    std::queue<int> q;
    q.push(s);
    dist[s] = 0;

    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        for (int i : adj[nod]) {
            if (dist[i] == -1) {
                q.push(i);
                dist[i] = dist[nod] + 1;
            }
        }
    }
}

int main() {
    int n,m,s;

    f >> n >> m >> s;

    adj.resize(n+5);
    dist.resize(n+5);

    for (int i = 0; i < m; i++) {
        int x,y;
        f >> x >> y;
        adj[x].push_back(y);
    }

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

    BFS(s);

    for (int i = 1; i <= n; i++) {
            g << dist[i] << ' ';
    }
    return 0;
}