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

using namespace std;

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

const int NLIM = 100005;

int N, M, Start;
int Distanta[NLIM];
vector <int> Graf[NLIM];
queue <int> Coada;

void BFS()
{
    int Nod, Vecin;
    while(!Coada.empty())
    {
        Nod = Coada.front();
        Coada.pop();
        for(unsigned i=0; i < Graf[Nod].size(); i++)
        {
            Vecin = Graf[Nod][i];
            if(Distanta[Vecin] == -1)
            {
                Coada.push(Vecin);
                Distanta[Vecin] = Distanta[Nod] + 1;
            }
        }
    }
}

void Citire()
{
    fin>>N>>M>>Start;
    int x,y;
    for(int i=1; i <= M; i++)
    {
        fin>>x>>y;
        Graf[x].push_back(y);
    }
    for(int i = 1; i <= N; i++) Distanta[i] = -1;
    Distanta[Start] = 0;
}

int main()
{
    Citire();
    Coada.push(Start);
    BFS();

    for(int i = 1; i <= N; i++) fout<<Distanta[i]<<" ";

    return 0;
}