#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f,*g;
struct graph
{
    int node, next;
}v[1000002];
int start[100002],d[100002],coada[1000002];
int n,m,s;
void read()
{
    int k=0,x,y;
    fscanf(f,"%d %d %d",&n,&m,&s);
    for(int i=1; i<=m; i++)
    {
        fscanf(f,"%d %d",&x,&y);
        v[++k].node=y;
        v[k].next=start[x];
        start[x]=k;
    }
}
void bfs()
{
    int pi,ps,x,y;
    for(int i=1; i<=n; i++)
        d[i]=99999999;
    d[s]=0;
    coada[pi=ps=0]=s;
    while(ps<=pi)
    {
        x=coada[ps];
        for(int i=start[x]; i; i=v[i].next)
            if(d[x]+1<d[v[i].node])
            {
                d[v[i].node]=d[x]+1;
                coada[++pi]=v[i].node;
            }
        ps++;
    }
}
void write()
{
    for(int i=1; i<=n; i++)
        if(d[i]!=99999999)
            fprintf(g,"%d ",d[i]);
        else
            fprintf(g,"-1 ");
}
int main()
{
    f=fopen("bfs.in","r");
    g=fopen("bfs.out","w");
    read();
    bfs();
    write();
    fclose(f);
    fclose(g);
    return 0;
}