#include <fstream>
#include <vector>
#include <queue>
using namespace std;

#define vecSize 100001

vector<int> L[vecSize];     // Lista de adiacenta
vector<int> D(vecSize, -1); // Distante

queue<int> coada;

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

void BFS(int sursa)
{
    D[sursa] = 0;
    coada.push(sursa);

    while (!coada.empty())
    {
        int node = coada.front();
        coada.pop();
        for (const auto &vec : L[node])
        {
            // if (D[vec] > D[node] + 1)
            if (D[vec] == -1)
            {
                coada.push(vec);
                D[vec] = D[node] + 1;
            }
        }
    }
}

int main()
{
    int n, m, s;
    fin >> n >> m >> s;

    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        L[x].push_back(y);
    }

    BFS(s);

    for (int i = 1; i <= n; i++)
    {
        fout << D[i] << " ";
    }

    fout << "\n";

    return 0;
}