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

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> v[100005];//matricea de adiacenta
int n,m,xi;
int d[100005];//dostanta
queue <int>c ;//coada


void cit()
{ int x,y;
    f>>n>>m>>xi;
    for(int i =1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);

    }
}
void bfs(){
c.push(xi);
int x;
while(!c.empty())
{
    x=c.front();
    c.pop();

    for(unsigned int  i=0;i<v[x].size();i++)
    {
        int z=v[x][i];
        if(d[z]==-1){
         d[z]=d[x]+1;
         c.push(z);

        }

    }

}


}

int main()
{cit();
for(int i=1;i<=n;i++)d[i]=-1;

d[xi]=0;
bfs();
for(int i=1;i<=n;i++)g<<d[i]<<" ";



}