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

using namespace std;

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

const int NMAX=100005;

queue < int > Coada;
vector < int > Muchii[NMAX];
int N,M,START;
int Distante[NMAX];

int main()
{
    fin>>N>>M>>START;
    for (int i=1; i<=M; i++)
    {
        int x,y;
        fin>>x>>y;
        Muchii[x].push_back(y);
    }
    for (int i=1; i<=N; i++)
    Distante[i]=-1;
    Distante[START]=0;
    Coada.push(START);
    while (!Coada.empty())
    {
        int Nod=Coada.front();
        Coada.pop();
        for (int i=0; i<Muchii[Nod].size(); i++)
        {
            int Vecin=Muchii[Nod][i];
            if (Distante[Vecin]==-1)
            {
                Coada.push(Vecin);
                Distante[Vecin]=Distante[Nod]+1;
            }
        }
    }

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

}