#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int m,n,s;
int distanta[100005];
vector <int>v[100005];
queue <int>q;
void bfs()
{
    int nod,i,next;
    while(q.empty()==0)
    {nod=q.front();
    q.pop();
    for(i=0;i<v[nod].size();i++)
        {next=v[nod][i];
        if(distanta[next]==-1)
            {q.push(next);
            distanta[next]=distanta[nod]+1;}}}}
int main()
{
f>>n>>m>>s;
    for(int i=1;i<m;i++)
    {int x, y;
    f>>x>>y;
    v[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    distanta[i]=-1;

    distanta[s]=0;

    q.push(s);
    bfs();

    for(int i=1;i<n;i++)
    g<<distanta[i]<<" ";
}