#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>

using namespace std;

vector<int> adjacencyList[100001];
queue<int> q;
int d[100001];
int visited[100001];

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

    int n,m,s;
    scanf("%d %d %d", &n, &m, &s);

    for (int i=0; i<m; i++){
        int from, to;
        scanf("%d %d", &from, &to);
        adjacencyList[from].push_back(to);
    }

    q.push(s);
    d[s] = 0;

    while (!q.empty()) {
        int currentNode = q.front();
        q.pop();

        for (int i=0; i<adjacencyList[currentNode].size(); i++){
            int nodeToVisit = adjacencyList[currentNode][i];

            if (!visited[nodeToVisit]){
                q.push(nodeToVisit);
                d[nodeToVisit] = d[currentNode] + 1;
                visited[nodeToVisit] = 1;
            }
        }
    }

    for (int i=1; i<=n; i++){
        if (d[i] == 0){
            if (i == s){
                printf("0 ");
            }
            else {
                printf("-1 ");
            }
        } else {
            printf("%d ", d[i]);
        }
    }


    return 0;
}