#include <iostream>
#include <fstream>

#define maxSize 100001

using namespace std;

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

struct nod {int info; nod *urm;}*vecini[maxSize];
int coada[maxSize];
int cost[maxSize];
int n,m,S;

void add(nod *&dest, int val)
{
    nod *i;
    i=new nod;
    i->info=val;
    i->urm=dest;
    dest=i;
}

void citire()
{
    int x,y;
    fin>>n>>m>>S;
    while (m--)
    {
        fin>>x>>y;
        add(vecini[x],y);
    }
}

void BFS(int S)
{
    int p,u;
    p=u=1;
    coada[p]=S;
    cost[S]=1;
    while (p<=u)
    {
        S=coada[p++];
        for (nod *i=vecini[S]; i; i=i->urm)
            if (!cost[i->info]) {
                cost[i->info]=cost[S]+1;
                coada[++u]=i->info;
        }
    }
}


int main()
{
    citire();
    BFS(S);
    for (int i=1; i<=n; ++i)
        fout<<cost[i]-1<<" ";
    return 0;
}