#include <stdio.h>
#include <vector>
#include <utility>
#include <queue>
#include <map>

#define WHITE 1
#define GRAY  2
#define BLACK 3

std::vector<int> adj[100001];
int visited[100001];

void init_visited()
{
    for (int i = 0; i < 100001; i++)
        visited[i] = -1;
}

void bfs(std::vector<int> *adj, int s)
{
    std::queue<int> q;

    init_visited();

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

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

        for (int i = 0; i < adj[node].size(); i++)
        {
            int child = adj[node][i];
            if (visited[child] == -1)
            {
                q.push(child);
                visited[child] = visited[node] + 1;
            }
        }
    }
}

int main()
{
    int m, n, s, i; 

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

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

    for (i = 0; i < m; i++)
    {
        int x, y;
        scanf("%d %d", &x, &y);
    
        adj[x].push_back(y);
    }

    bfs(adj, s);

    for (i = 1; i <= n; i++)
        printf("%d ", visited[i]);

    return 0;
}