#include <bits/stdc++.h>
using namespace std;
int n,m,d,q,a[20][20],b[20];
void dfs(int x){
	printf("%d ",x);
	for(int i=1;i<=n;i++){
		if(a[x][i]&&!b[i]){
			a[x][i]=0;
			a[i][x]=0;
			b[i]=1;
			dfs(i);
		}
	}
}
int main(){
	cin>>n>>m;
	while(m--){
		scanf("%d%d",&d,&q);
		a[d][q]=1;
		a[q][d]=1;
	}
	b[1]=1;
	dfs(1);
	return 0;
}
/**************************************************************
	Problem: 2052
	User: chenshuo
	Language: C++
	Result: Accepted
	Time:19 ms
	Memory:2080 kb
****************************************************************/