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

#define NMAX 100001

int n,m,l,start;
vector<int> A[NMAX];
int G[NMAX], Cost[NMAX], S[NMAX];

void BFS(int nod)
{
    memset(Cost, -1, sizeof(Cost));

    l=1;
    Cost[nod] = 0;
    S[l] = nod;

    for(int i=1; i<=l; i++)
        for(int j=0; j < G[S[i]]; j++)
          if (Cost[A[S[i]][j]] == -1)
          {
              S[++l] = A[S[i]][j];
              Cost[S[l]] = Cost[S[i]] + 1;
          }
}

int main()
{
    freopen("bfs.in", "r", stdin);
    scanf("%d%d%d", &n, &m, &start);

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

    for(int i=1; i<=n; i++)
        G[i] = A[i].size();

    BFS(start);

    freopen("bfs.out", "w" , stdout);
    for(int i=1;i<=n;i++)
        printf("%d ", Cost[i]);
    printf("\n");
}