#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s;
deque <int> graf[1000];
deque <int> coada;
int distanta[1000];
void bfs()
{
    while(!coada.empty())
    {
        int nod=coada.front();
        coada.pop_front();
        for(unsigned int i=0; i<graf[nod].size(); i++)
        {

            if( distanta[graf[nod][i]]==-1)
            {
                distanta[graf[nod][i]]=distanta[nod]+1;
                coada.push_back(graf[nod][i]);
            }

        }
    }

}
void citire()
{
    fin>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        int x, y;
        fin>>x>>y;

        graf[x].push_front(y);
    }
    for(int i=1;i<=n;i++)
        distanta[i]=-1;
    distanta[s]=0;
    coada.push_back(s);
    bfs();

}
void principal()
{


    for(int i=1; i<=n; i++)
    {
        fout<<distanta[i]<<' ';
    }
}
void afisare()
{
    for(int i=1; i<=n; i++)
    {
        fout<<i<<' ';
        for(unsigned int j=0; j<graf[i].size(); j++)
        {
            fout<<graf[i][j]<<' ';
        }
        fout<<endl;
    }
}
int main()
{
    citire();
    ///afisare();
    principal();
}