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

using namespace std;

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

vector< int > Vector[100005];
queue< int > Coada;
int n, m, start;
int distanta[100005];

void BFS()
{
    int nod, vecin;
    Coada.push(start);
    while (Coada.empty() == false)
    {
        nod = Coada.front();
        for (int i = 0; i < Vector[nod].size(); i++)
        {
            vecin = Vector[nod][i];
            if (distanta[vecin] == -1)
            {
                Coada.push(vecin);
                distanta[vecin] = distanta[nod] + 1;
            }
        }
        Coada.pop();
    }
}

int main()
{
    f >> n >> m >> start;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        Vector[x].push_back(y);
    }

















    for (int i = 1; i <= n; i++)
    {
        distanta[i] = -1;
    }
    distanta[start] = 0;

    BFS();

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