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

#define Nmax 100001

std::vector<int> G[Nmax];
std::vector<int> dist;
int N, M, S;

int main()
{
    std::ifstream f("bfs.in");

    int x, y;

    f >> N >> M >> S;
    while (M--)
    {
        f >> x >> y;
        G[x].push_back(y);
    }

    f.close();

    dist.resize(N + 1);
    std::fill(dist.begin(), dist.end(), -1);

    std::queue<int> q;
    q.push(S);
    dist[S] = 0;

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

        for (auto it = G[node].begin(); it != G[node].end(); ++it)
        {
            if (dist[*it] == -1)
            {
                dist[*it] = dist[node] + 1;
                q.push(*it);
            }
        }
    }

    std::ofstream g("bfs.out");
    for (int i = 1; i <= N; ++i)
    {
        g << dist[i] << ' ';
    }
    g.close();

    return 0;
}