#include <stdio.h>
#include <stdlib.h>
int n,m,*a[100000],c[100000],d[100000];
char viz[100000];
void DFS(int x)
{
    int i;
    printf("%d ",x);
    viz[x]=1;
    for(i=1; i<=a[x][0]; i++)
     if(!viz[a[x][i]]) DFS(a[x][i]);
}
void BFS(int x)
{
    int i,prim,ultim;
    //printf("%d ",x);
    for(c[0]=x,viz[x]=1,prim=ultim=0; prim<=ultim; )
    {
        x=c[prim++];
        for(i=1; i<=a[x][0]; i++)
         if(!viz[a[x][i]])
         {
             printf("%d ",a[x][i]);
             viz[a[x][i]]=1;
             c[++ultim]=a[x][i];
             d[a[x][i]]=d[x]+1;
         }
    }
}
int main()
{
    int i,j,k,s;
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d %d %d",&n,&m,&s);
    for(i=1; i<=n; i++)
    {
        a[i]=(int *)realloc(a[i],sizeof(int));
        a[i][0]=0;
    }
    for(k=0; k<m; k++)
    {
        scanf("%d %d",&i,&j);
        a[i][0]++;
        a[i]=(int *)realloc(a[i],(a[i][0]+1)*sizeof(int));
        a[i][a[i][0]]=j;
        a[j][0]++;
        a[j]=(int *)realloc(a[j],(a[j][0]+1)*sizeof(int));
        a[j][a[j][0]]=i;
    }
    BFS(s);
    for(i=1; i<=n; i++)
     if(s!=i && !d[i]) printf("-1");
     else printf("%d ",d[i]);
    return 0;
}