#include <bits/stdc++.h>
using namespace std;
vector <int> Muchii[100002];
int distanta[100002], n, m, s;
queue <int> coada;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int main()
{
    fin >> n >> m >> s;
    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        Muchii[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i) distanta[i] = -1;
    distanta[s] = 0;
    coada.push(s);
    while (!coada.empty())
    {
        for (int i = 0; i < Muchii[coada.front()].size(); ++i)
        {
            if (distanta[Muchii[coada.front()][i]] == -1)
            {
                distanta[Muchii[coada.front()][i]] = 1 + distanta[coada.front()];
                coada.push(Muchii[coada.front()][i]);
            }
        }
        coada.pop();
    }
    for (int i = 1; i <= n; ++i)
    {
        fout << distanta[i] << " ";
    }
}