#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

const int N = 100005;

vector <int> muchii[N];
queue <int> coada;
int distanta[N];

void breadth_first_search()
{
    int current_node;
    while(!coada.empty()) ///cat timp coada nu este goala
    {
        current_node = coada.front(); ///extragem primul element din coada
        coada.pop(); ///il stergem din coada

        for(auto next_node : muchii[current_node])
        {
            if(distanta[next_node] == -1) ///daca nu am fost acolo
            {
                coada.push(next_node);
                distanta[next_node] = distanta[current_node] + 1; ///inaintam

            }
        }
    }
}

int main()
{
    int n, m, nod_start, x, y;

    in >> n >> m >> nod_start;

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

    for(int i = 1; i <= n; i++)
    {
        distanta[i] = -1;
    }
    distanta[nod_start] = 0; ///distanta la nodul de start este 0

    coada.push(nod_start); ///adugam in coada nodul de start

    breadth_first_search();

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

    in.close();
    out.close();
    return 0;
}