#include <bits/stdc++.h>

using namespace std;

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

int n, m, x, y, startNode;

void bfs(int& start, int& n, vector < int >& dist, vector < int >* adjList) {
    queue < int > q;
    vector < bool > visited(n+1, false);
    q.push(start);
    visited[start] = true;
    while (!q.empty()) {
        int firstInQueue = q.front();
        q.pop();

        for (auto const& adjNode: adjList[firstInQueue]) {
            if (!visited[adjNode] && dist[adjNode] == -1) {
                dist[adjNode] = dist[firstInQueue] + 1;
                q.push(adjNode);
                visited[adjNode] = true;
            }
        }
    }
}

int main() {
    f >> n >> m >> startNode;

    vector < int > adjList[n+1];
    vector < int > dist(n+1, -1);
    dist[startNode] = 0;

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

    bfs(startNode, n, dist, adjList);
    for (int i = 1; i <= n; ++i) {
        g << dist[i] << " ";
    }
}