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