#include <iostream>
#include <stdio.h>
#include <vector>
#include <cstring>
using namespace std;

int n,m,start,i,j,Q[100010],C[100010],x,y,G[100010];
vector <int> A[100010];

void bfs(int nod)
{
    int L;
    L = 1;
    Q[L] = nod;
    C[nod] = 0;
    for(i=1;i<=L;i++)
      for(j=0;j<G[Q[i]];j++)
        if(C[A[Q[i]][j]] == -1)
        {
            L++;
            Q[L] = A[Q[i]][j];
            C[Q[L]] = C[Q[i]] + 1;
        }
}

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    scanf("%d %d %d",&n,&m,&start);
    for(i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        A[x].push_back(y);
    }

    memset(C,-1,sizeof(C));
    for(i=1;i<=n;i++)
        G[i] = A[i].size();
    bfs(start);
    for(i=1;i<=n;i++)
        printf("%d ",C[i]);
    printf("\n");
    return 0;
}