#include <stdio.h>
#include <deque>
#include <vector>
using namespace std;
deque<int> v[100000],coada;
int a,b,n,m,s,i,nod,sol[100001],cnt;
bool viz[100001];
int main()
{
    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",&a,&b);
        v[a].push_front(b);
    }
    coada.push_front(s);
    cnt=1;
    while(!coada.empty())
    {
        nod = coada.front();
        if(viz[nod] == 0)
            for(i=0; i<v[nod].size(); i++)
            {
                if(v[nod][i]!=nod)
                {
                    coada.push_back(v[nod][i]);
                    if(viz[v[nod][i]] == 0 && sol[v[nod][i]] == 0)
                        sol[v[nod][i]]=cnt;
                }
            }
        cnt++;
        viz[nod] = 1;
        coada.pop_front();
    }
    for(i=1; i<s; i++)
        printf("%d ",sol[i] ? sol[i] : -1);
    printf("0 ");
    for(i=s+1; i<=n; i++)
        printf("%d ",sol[i] ? sol[i] : -1);
        return 0;
}