#include <fstream>
#include <queue>
#define MAX_VERTICES 100010 // 100010
using namespace std;

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

int graph[MAX_VERTICES][MAX_VERTICES];

void BFS(int start_vertex, int nr_vertices) {
    queue<int> vertices;
    int distances[MAX_VERTICES];
    for (int i = 1; i <= nr_vertices; i++) {
        distances[i] = -1;
    }
    vertices.push(start_vertex);
    distances[start_vertex] = 0;
    while (!vertices.empty()) {
        int current = vertices.front();
        vertices.pop();
        for (int j = 1; j <= nr_vertices; ++j) {
            if (graph[current][j] == 1 && distances[j] == -1) {
                vertices.push(j);
                distances[j] = distances[current] + 1;
            }
        }
    }
    for (int i = 1; i <= nr_vertices; ++i) {
        fout << distances[i] << " ";
    }
    fout << '\n';
}

int main() {
    int nr_vertices, nr_edges, start_vertex, vertexA, vertexB;
    fin >> nr_vertices >> nr_edges >> start_vertex;
    for (int i = 0; i < nr_edges; i++) {
        fin >> vertexA >> vertexB;
        ++graph[vertexA][vertexB];
    }
    BFS(start_vertex, nr_vertices);
    return 0;
}