#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> muchii[1000000];
queue <int> coada;
int n,m,nodstart,distanta[1000000];

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


return 0;
}