#include
int main()
{
int i,j,n,m,a,b,cur,book[101]={0},e[101][101];
int que[10001], head, tail;
scanf("%d %d", &n, &m);
//邻接矩阵åˆå§‹åŒ–
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(i == j) e[i][j] = 0;
else e[i][j] = 99999999;
for(i=1; i<=m; i++)
{
scanf("%d %d", &a, &b);
e[a][b] = 1;
e[b][a] = 1;
}
head=1;
tail=1;
que[tail] = 1;
tail++;
// åƒä¸‡è®°å¾—è¦å¯¹ç¬¬ä¸€ä¸ªèŠ‚ç‚¹æ ‡è®°å“Ÿï¼
book[1] = 1;
while(head n)
break;
}
head++;
}
printf("\n");
for(i=1; i<=n; i++)
printf("%d ", que[i]);
// getchar();getchar();
return 0;
}