#include<cstdio>
#include<cstdlib>
#define NMAX 100001
#define LMAX 1000001
using namespace std;

int n, m, x, cost[NMAX], coada[LMAX];
struct nod
{
    int val;
    nod *next;
};

nod *L[NMAX];

void Read()
{
    int i, a, b;
    nod *p;
    FILE *fin = fopen("bfs.in","r");
    fscanf(fin,"%d%d%d",&n,&m,&x);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d",&a,&b);
        p = new nod;
        p->val = b;
        p->next = L[a];
        L[a] = p;
    }
    fclose(fin);
}

void BFS(int x)
{
    int prim, ultim, y, i;
    nod *p;
    prim = ultim = 0;
    for(i=1; i<=n; i++)
        cost[i] = -1;
    coada[prim] = x;
    cost[x] = 0;
    while(prim <= ultim)
    {
        y = coada[prim++];
        p = L[y];
        while(p != NULL)
        {
            if(cost[p->val] == -1)
            {
                cost[p->val] = cost[y] + 1;
                coada[++ultim] = p->val;
            }
            p = p->next;
        }
    }
}

void Write()
{
    FILE *fout = fopen("bfs.out","w");
    for(int i=1; i<=n; i++)
        fprintf(fout,"%d ",cost[i]);
    fprintf(fout,"\n");
    fclose(fout);
}

int main()
{
    Read();
    BFS(x);
    Write();
    return 0;
}