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

using namespace std;
const int nlim = 100005;
int n, m, nodStart;
int distanta[nlim];

vector <int> Muchie[nlim];
queue <int> Coada;

ifstream f("bfs.in");
ofstream g("bfs.out");
int vecin;
void bfs()
{
    while(!Coada.empty())
    {
        int nod = Coada.front();
        Coada.pop();
        for(unsigned i = 0; i<Muchie[nod].size(); i++)
        {
            vecin = Muchie[nod][i];
            if(distanta[vecin] == -1)
            {
                Coada.push(vecin);
                distanta[vecin] = distanta[nod] + 1;
            }
        }

    }
}
void citire()
{
    f>>n>>m>>nodStart;
    int x, y;
    for(int i = 1; i <= m; i++)
    {
        f>>x>>y;
        Muchie[x].push_back(y);
    }
    for(int i = 1; i <= n; i++)
    distanta[i] = -1;
    distanta[nodStart] = 0;
    Coada.push(nodStart);
    bfs();
    for(int i = 1; i <= n; i++)
        g<<distanta[i]<<" ";

}
int main()
{
    citire();
    return 0;
}