#include <fstream>

int n, m, s, c[100000], vis[100000], p, u, v, x, y, k[100000];
struct nod
{
    int info;
    nod *urm;
} *lista[100000], *aux, *point;

using namespace std;

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    in>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        in>>x>>y;
        aux=new nod;
        aux->info=y;
        aux->urm=lista[x];
        lista[x]=aux;
    }
    c[1]=s;
    vis[s]=1;
    p=u=1;
    for(int i=1; i<=n; i++) k[i]=-1;
    k[s]=0;
    while(p<=u)
    {
        v=c[p]; p++;
        for(int i=1; i<=n; i++)
            if(vis[i]==0)
            {
                int ok=0;
                aux=lista[v];
                point=aux;
                while(!ok && point!=0)
                {
                    if(point->info==i)ok=1;
                    else point=point->urm;
                }
                if(ok)
                {
                    u++;
                    c[u]=i;
                    vis[i]=1;
                    k[i]=k[v]+1;
                }

            }


    }
    for(int i=1; i<=n; i++) out<<k[i]<<" ";
    return 0;

}