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

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

int N, M, S, arce_pana_la[100005];

vector<int> G[100005];
queue<int> coada;

void Lee()
{
    while (!coada.empty())
    {
        int nod_curent = coada.front();
        coada.pop();
        for (int i = 0; i < G[nod_curent].size(); i++)
        {
            int nod_vecin;
            nod_vecin = G[nod_curent][i];
            if (arce_pana_la[nod_vecin] == 0)
            {
                coada.push(nod_vecin);
                arce_pana_la[nod_vecin] = arce_pana_la[nod_curent] + 1;
            }
        }
    }
}

int main()
{
    fin >> N >> M >> S;
    for (int i = 0; i < M; i++)
    {
        int nod1, nod2;
        fin >> nod1 >> nod2;
        G[nod1].push_back(nod2);
    }
    arce_pana_la[S] = 1;
    coada.push(S);
    Lee();
    for (int i = 1; i <= N; i++)
        fout << arce_pana_la[i] - 1 << " ";
    fout << "\n";
    return 0;
}