#include <bits/stdc++.h>
using namespace std;

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

void bfs(vector<vector<int>>& graph, int start, vector<int>& distances) {
    int n = graph.size();
    vector<bool> visited(n, false);
    queue<int> q;
    q.push(start);
    visited[start] = true;
    distances[start] = 0;
    while (!q.empty()) {
        int current = q.front();
        q.pop();
        for (int neighbor : graph[current]) {
            if (!visited[neighbor]) {
                q.push(neighbor);
                visited[neighbor] = true;
                distances[neighbor] = distances[current] + 1;
            }
        }
    }
}

int main() {
    int n, m, start;
    fin >> n >> m >> start;
    vector<vector<int>> graph(n + 1);
    for (int i = 0; i < m; ++i) {
        int x, y;
        fin >> x >> y;
        graph[x].push_back(y);
    }
    vector<int> distances(n + 1, -1);
    bfs(graph, start, distances);
    for (int i = 1; i <= n; ++i) {
        fout << distances[i] << " ";
    }
    return 0;
}