#include <iostream>
#include <fstream>
#define nmax 100000
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,viz[nmax+5],sol[nmax+5],t=1,s;
struct nod
{
    int info;
    nod *urm;
}*v[nmax+5],*c,*d;
void bfs(int k)
{
    if(k>t)
        return;
    nod *e=v[sol[k]];
    while(e->urm)
    {
        e=e->urm;
        if(!viz[e->info])
        {
            viz[e->info]=viz[sol[k]]+1;
            sol[++t]=e->info;
        }
    }
    bfs(k+1);
}
int main()
{
    int x,y;
    fin>>n>>m>>s;
    for(int i=1;i<=n;i++)
    {
        v[i]=new nod;
        v[i]->info=i;
        v[i]->urm=0;
    }
    while(fin>>x>>y)
    {
        if(x!=y)
        {c=v[x];
        while(c->urm)
            c=c->urm;
        d=new nod;
        d->urm=0;
        d->info=y;
        c->urm=d;}
    }
    viz[s]=1;
    sol[t]=s;
    bfs(1);
    for(int i=1;i<n;i++)
        fout<<viz[i]-1<<" ";
    fout<<viz[n]-1;
    return 0;
}