#include<cstdio>
#include<queue>
#define MAX_N 100000
using namespace std;

int d[MAX_N+1], n, m, S;
queue<int>Q;
struct nod
{
    int val;
    nod* next;
};

nod* L[MAX_N+1];

void Insert(int x, int y)
{
    nod* elem = new nod;
    elem->val = y;
    elem->next = L[x];
    L[x] = elem;
}

void Read()
{
    int i, a, b;
    FILE *fin = fopen("bfs.in","r");
    fscanf(fin,"%d%d%d",&n,&m,&S);
    for(i=1; i<=m; i++)
    {
        fscanf(fin,"%d%d",&a,&b);
        Insert(a,b);
    }
    fclose(fin);
}

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

void BFS(int x)
{
    int Nod, i;
    nod* p;
    for(i=1; i<=n; i++)
        d[i] = -1;
    d[x] = 0;
    Q.push(x);
    while(!Q.empty())
    {
        Nod = Q.front();
        Q.pop();
        p = L[Nod];
        while(p != NULL)
        {
            if(d[p->val] == -1)
            {
                d[p->val] = d[Nod] + 1;
                Q.push(p->val);
            }
            p = p->next;
        }
    }
}

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