#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s;
const int NLIM=100005;
vector <int> Muchii[NLIM];
int distanta[NLIM];
queue < int > Coada;
void BFS()
{
    int Nod,Vecin;
    while(!Coada.empty())
    {
        Nod=Coada.front();
        Coada.pop();
        for(unsigned int i=0;i<Muchii[Nod].size();i++)
        {
            Vecin=Muchii[Nod][i];
            if(distanta[Vecin]==-1)
            {
                Coada.push(Vecin);
                distanta[Vecin]=distanta[Nod]+1;
            }
        }
    }
}
void Citire()
{int i;
    f>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        int x,y;
        f>>x>>y;
        Muchii[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        distanta[i]=-1;
    distanta[s]=0;
    Coada.push(s);
    BFS();
    for(i=1;i<=n;i++)
        g<<distanta[i]<<" ";
}
int main()
{
    Citire();
    return 0;
}