#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>

using namespace std;

#define maxn 100010

vector<int> a[maxn];
int v[maxn],d[maxn],cost[maxn];
int l,n,m,s;

void bfs(int nod)
{
    int i,j;
    memset(cost,-1,sizeof(cost));
    l=1;
    cost[nod]=0;
    d[l]=nod;
    for (i=1;i<=l;i++)
        for (j=0;j<v[d[i]];j++)
            if(cost[a[d[i]][j]]==-1)
            {
                d[++l]=a[d[i]][j];
                cost[d[l]]=cost[d[i]]+1;
            }
}

int main()
{
    int i,x,y;
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&s);
    for (i=1;i<=m;i++)
      {
          scanf("%d%d",&x,&y);
          a[x].push_back(y);
      }
    for (i=1;i<=n;i++) v[i]=a[i].size();
    bfs(s);
    for (i=1;i<=n;i++) printf("%d ",cost[i]);
    return 0;
}