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

#define MX 100001

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

struct nod
{
    int info;
    nod *urm;
};
nod *L[MX];

int n, m, st, fr[MX];
queue <int> C;

void adauga(int i, int j)
{
    nod *p=new nod;
    p->info=j;
    p->urm=L[i];
    L[i]=p;
}

void citire()
{
    fin>>n>>m>>st;
    int i, j;
    for(int k=1;k<=m;k++)
    {
        fin>>i>>j;
        adauga(i,j);
    }
    fin.close();
}

void BFS(int poz)
{
    C.push(poz);
    fr[poz]=1;
    int curent;
    while(!C.empty())
    {
        curent=C.front();
        C.pop();
        for(nod *p=L[curent];p!=NULL;p=p->urm)
        {
            if(fr[p->info]==0)
            {
                fr[p->info]=fr[curent]+1;
                C.push(p->info);
            }
        }
    }
}

void afisare()
{
    for(int i=1;i<=n;i++)
    {
        if(i==st)
            fout<<0<<' ';
        else if(fr[i]==0)
            fout<<-1<<' ';
        else
            fout<<fr[i]-1<<' ';
    }
    fout.close();
}

int main()
{
    citire();
    BFS(st);
    afisare();
    return 0;
}