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

using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
class graf
{
    int n,m,s;
    vector< vector<int> > lista_vecini;
public:
    graf();
    int setn(const int x);
    int setm(const int x);
    int getn();
    int getm();
    int gets();
    void getvecini();
    void DFS();

};


graf::graf()
{
    int x,y;
    f>>this->n>>this->m>>this->s;
    this->lista_vecini.resize(n+1);
    for (int i=0; i<m; ++i)
    {
        f>>x>>y;
        this->lista_vecini[x].push_back(y);
    }
}

int graf::getm()
{
    return this->m;
}

int graf::getn()
{
    return this->n;
}

int graf::gets()
{
    return this->s;
}

void graf::getvecini()
{
    for (int i=1;i<this->lista_vecini.size();++i)
    {
        cout<<i<<": ";
        for (int j=0;j<this->lista_vecini[i].size();++j)
            cout<<this->lista_vecini[i][j]<<" ";
            cout<<"\n";
    }
}

void graf::DFS()
{
    int d[this->n+1];
    for (int i=1;i<=n;++i)
        d[i]=-1;
    bool viz[this->n+1];
    int index=0;
    vector <int> coada;
    coada.push_back(this->s);
    d[this->s]=0;
    while (index<coada.size())
    {
     int nod_curent=coada[index++];
     viz[nod_curent]=true;
     for (int i=0;i<this->lista_vecini[nod_curent].size();++i)
        if (!viz[this->lista_vecini[nod_curent][i]])
        {
            coada.push_back(this->lista_vecini[nod_curent][i]);
            d[this->lista_vecini[nod_curent][i]]=d[nod_curent]+1;
        }
    }
    for (int i=1;i<=n;++i)
        g<<d[i]<<" ";
}

int main()
{
    graf a;
    a.DFS();
    return 0;
}