#include<bits/stdc++.h>
using namespace std;
#define N 300005
#define mkp(oo,ooo) make_pair(oo,ooo)
#define w(o,oo) mp[mkp(o,oo)]
inline int read(){
    int x=0,f=1; char c=getchar();
    while(c>'9'||c<'0'){if(c=='-') f=-1; c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+(c^'0'); c=getchar();}
    return x*f;
}int pre[N],nex[N],x,ed;
map<pair<int,int>,int> mp;
signed main(){
	int n=read(),m=read();
	for(int i=1;i<=m;i++){
		int x=read(),y=read();
		mp[mkp(x,y)]=mp[mkp(y,x)]=1;
	}if(n<=2||!m){
        for(int i=1;i<=n;i++) printf("%d ",i);
        printf("\n");
        return 0;
    }nex[1]=2; pre[2]=1; ed=2;
    for(int i=3;i<=n;i++){
        if(!x){
            nex[ed]=i; pre[i]=ed;
            if(w(ed,i)!=w(ed,pre[ed])) x=ed;
            ed=i;
            continue;
        }
        int a=pre[x],b=nex[x];
        if(w(x,a)==w(i,x)){
            nex[x]=i; nex[i]=b; 
            pre[i]=x; pre[b]=i;
            if(w(x,i)==w(i,b)) x=b; 
            else x=i;
            if(!pre[x]||!nex[x]) x=0;
        }else{
            nex[a]=i; nex[i]=x; 
            pre[i]=a; pre[x]=i;
            if(w(x,i)==w(i,a)) x=a; 
            else x=i;
            if(!pre[x]||!nex[x]) x=0;
        }
    }int p=1;
    while(p){printf("%d ",p);p=nex[p];}
    return 0;
}