#include <cstdio>
#include <queue>
using namespace std;
int const N=1000001;
int const M=100000;
int vf[N],urm[N],lst[N],nr;
int cost[M],viz[M];
queue<int> q;

void addEdge(int x,int y)
{
    vf[++nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
}

void bfs(int p)
{
    int prm=1,ult=1,poz,y;
    cost[p] = 0;
    viz[p] = true;
    q.push(p);
    while(!q.empty())
    {
        p = q.front();
        q.pop();
        poz = lst[p];
        while(poz!=0)
        {
            y = vf[poz];
            if(cost[y] == 0 && !viz[y])
            {
                cost[y] = 1 + cost[p];
                viz[y] = true;
                q.push(y);
            }
            poz = urm[poz];
        }
    }
}

int main()
{
    int i,n,m,s,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);
        addEdge(x,y);
    }
    bfs(s);
    for(i=1;i<=n;i++)
    {
        if(cost[i] == 0 && i!=s) printf("-1 ");
        else printf("%d ",cost[i]);
    }
    return 0;
}