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

using namespace std;

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

int const NLIM=100005;

queue <int> coada;
vector <int> muchii[NLIM];

int n,m,nodstart,distanta[NLIM];

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()
{
    fin>>n>>m>>nodstart;
    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)
        distanta[i]=-1;
    distanta[nodstart]=0;
    coada.push(nodstart);
    bfs();
    for(int i=1;i<=n;++i)
        fout<<distanta[i]<<" ";

}

int main()
{
    citire();
    return 0;
}