#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
queue<int>cd;
int n,m,x,y,start,i,viz[100010],nra[100010];

struct nod{
    int info;
    nod* urm;
};
nod* v[100010],*q;

int main()
{
    fin>>n>>m>>start;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        q=new nod;
        q->urm=v[x];
        q->info=y;
        v[x]=q;
    }
    viz[start]=1;
    nra[start]=0;
    cd.push(start);
    while(!cd.empty())
    {
        x=cd.front();
        cd.pop();
        q=v[x];
        while(q!=NULL)
        {
            if(viz[q->info]==0)
            {
                nra[q->info]=nra[x]+1;
                viz[q->info]=1;
                cd.push(q->info);
            }
            q=q->urm;
        }
    }
    for(i=1;i<=n;i++)
    {
        if(viz[i]==1)
            fout<<nra[i]<<" ";
        else
            fout<<-1<<" ";
    }
    return 0;
}