#include <pthread.h>
#include <queue>
#include <stdio.h>
#include <fstream>
#include <vector>

using namespace std;

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

int main()
{
    int N, M, S;
    fin >> N >> M >> S;

    vector<vector<int>> adj (N +1, vector<int>());

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

    vector<bool> visited(N + 1, false);

    queue<int> q;

    vector<int> distance(N + 1, -1);

    q.push(S);

    visited[S] = true;
    distance[S] = 0;

    while (!q.empty()) {
        int node = q.front();
        q.pop();
        for (auto neigh : adj[node]) {
            if (!visited[neigh]) {
                q.push(neigh);
                distance[neigh] = distance[node] + 1;
                visited[neigh] = true;
            }
        }
    }
    
    for (int i = 1; i <= N; ++i) 
        fout << distance[i] << ' ';
fout<<'\n';
    return 0;
}