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

using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");
int n, m, s;
vector< vector<int> > graph;
vector<bool> visited;
vector<int> distante;

void bfs(int vertex);

int main()
{
    in >> n >> m >> s;

    if (n < 2 || n > 100000 || m < 1 || m > 1000000) return 1;

    graph.resize(n);
    visited.resize(n, false);
    distante.resize(n, 0);
    int x, y;

    for (int i = 0; i < m; i++) {
        in >> x >> y;
        x--;
        y--;
        graph[x].push_back(y);
    }
    in.close();

    bfs(s - 1);

    for (int i = 0; i < n; i++)
        out << distante[i] << " ";

    out.close();
    return 0;
}

void bfs(int vertex)
{
    if (vertex < 0 || vertex > n - 1) {
        return;
    }

    queue<int> q;
    int element, dist;

    q.push(vertex);
    visited[vertex] = true;

    while (!q.empty()) {
        element = q.front();
        dist = distante[element] + 1;
        for (int i = 0; i < graph[element].size(); i++)
            if (!visited[graph[element][i]]) {
                q.push(graph[element][i]);
                visited[graph[element][i]] = true;
                distante[graph[element][i]] = dist;
            }
        q.pop();
    }

    for (int i = 0; i < n; i++)
        if (!visited[i])
            distante[i] = -1;
}