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

using namespace std;

ifstream input("bfs.in");
ofstream output("bfs.out");


int cost[100002];
vector<int> adj[100002];
queue<int> q;

void BFS(int node)
{
    cost[node] = 0;
    q.push(node);
    while(!q.empty()){
        int next_node = q.front();
        q.pop();
        for(int i = 0; i < adj[next_node].size(); i++){
            if(cost[adj[next_node][i]] == -1){
                q.push(adj[next_node][i]);
                cost[adj[next_node][i]] = cost[next_node] + 1;
            }
        }
    }
}

int main()
{
    memset(cost, -1, sizeof(cost));
    int N, M, S;
    input >> N >> M >> S;
    for(int i = 0; i < M; i++){
        int x, y;
        input >> x >> y;
        adj[x].push_back(y);
    }
    BFS(S);

    for(int i = 1; i <= N; i++){
        output << cost[i] << " ";
    }
    return 0;
}