#include <iostream>
#include<cstdio>
#include<vector>
#define Nmax 100001
using namespace std;
vector <int> G[Nmax];
int N,M,s,C[Nmax],Cost[Nmax];
bool Use[Nmax];
int BFS()
{
 int i,j,l=1;
    for(i=0;i<l;i++)
    {
        int Nod=C[i];
        for(j=0;j<G[C[i]].size();j++)
        {
            int Vecin=G[Nod][j];
            if(!Use[Vecin])
            {
                Use[Vecin]=1;
                Cost[Vecin]=Cost[Nod]+1;
                C[l++]=Vecin;
            }
        }
    }
}
int main()
{
    int x,y,i;
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d %d %d",&N,&M,&s);
    C[0]=s;
    Use[s]=1;
    for(i=1;i<=M;i++)
    {
        scanf("%d %d",&x,&y);
        G[x].push_back(y);
    }
    BFS();
    Cost[s]=0;
    for(i=1;i<=N;i++)
        if(Cost[i]==0 && i!=s)
            printf("-1 ");
        else
            printf("%d ",Cost[i]);
    printf("\n");
    return 0;
    return 0;
}