#include <cstdio>
#include <map>
using namespace std;
const int N=3e5+5;
int n,m,u,v,lst,lf[N],rt[N];
bool eg[N];
map<int,bool> mp[N];
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1; i<=m; i++){
		scanf("%d%d",&u,&v);
		mp[u][v]=1;
		mp[v][u]=1;
	}
	rt[1]=2;
	lf[2]=1;
	rt[2]=n+1;
	lf[n+1]=2;
	eg[2]=mp[1][2];
	lst=2;
	for(int i=3; i<=n; i++){
		if(rt[lst]==n+1){
			rt[lst]=i;
			lf[i]=lst;
			rt[i]=n+1;
			lf[n+1]=i;
			eg[i]=mp[lst][i];
			if(eg[lst]==eg[i]) lst=i;
		}else{
			int t=mp[lst][i];
			if(t==eg[lst]){
				lf[i]=lst;
				rt[i]=rt[lst];
				lf[rt[lst]]=i;
				rt[lst]=i;
				eg[i]=t;
				eg[rt[i]]=mp[i][rt[i]];
				while(rt[lst]!=n+1&&eg[lst]==eg[rt[lst]]) lst=rt[lst];
			}else{
				lf[i]=lf[lst];
				rt[i]=lst;
				rt[lf[lst]]=i;
				lf[lst]=i;
				eg[lst]=t;
				eg[i]=mp[i][lf[i]];
				if(lf[i]==1&&eg[i]==eg[lst]) lst=lf[n+1];
				else while(lf[lst]!=1&&eg[lst]==eg[lf[lst]]) lst=lf[lst];
			}
		}
	}
	for(int i=1; i!=n+1; i=rt[i]){
		printf("%d ",i);
	}
	return 0;
}