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

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

int nrNoduri, nrMuchii, nodStart;

int distanta[100005];
vector < int > legaturi[100005];
queue < int > coada;

void Citire()
{
    fin >> nrNoduri >> nrMuchii >> nodStart;
    for (int i = 1; i <= nrMuchii; i++)
    {
        int x, y;
        fin >> x >> y;
        legaturi[x].push_back(y);
    }
    for (int i = 1; i <= nrNoduri; i++)
    {
        distanta[i] = -1;
    }
}

void BFS(int nodStart)
{
    coada.push(nodStart);
    distanta[nodStart] = 0;

    while(!coada.empty())
    {
        int nodCurent = coada.front();
        coada.pop();

        for (int i = 0; i < legaturi[nodCurent].size(); i++)
        {
            int nodUrmator = legaturi[nodCurent][i];

            if (distanta[nodUrmator] == -1)
            {
                coada.push(nodUrmator);
                distanta[nodUrmator] = 1 + distanta[nodCurent];
            }
        }
    }
}

void Afisare()
{
    for (int i = 1; i <= nrNoduri; i++)
    {
        fout << distanta[i] << ' ';
    }
}

int main()
{
    Citire();
    BFS(nodStart);
    Afisare();
    return 0;
}