#include<bits/stdc++.h>
using namespace std;
#define N 300005
//哈密顿，反哈密顿
int n,m;
map<int,int> G[N];
vector<int> S,T;
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1,u,v;i<=m;i++)scanf("%d%d",&u,&v),G[u][v]=G[v][u]=1;
    for(int i=n;i;i--){
        if(!S.size())S.push_back(i);
        else if(!T.size())T.push_back(i);
        else if(G[S.back()].find(i)!=G[S.back()].end())S.push_back(i);
        else if(G[T.back()].find(i)==G[T.back()].end())T.push_back(i);
        else if(G[S.back()].find(T.back())==G[S.back()].end())T.push_back(S.back()),T.push_back(i),S.pop_back();
        else S.push_back(T.back()),S.push_back(i),T.pop_back();
    }
    if(T.back()==1)swap(S,T);
    for(int i=(int)S.size()-1;i>=0;i--)printf("%d ",S[i]);
    for(int i=(int)T.size()-1;i>=0;i--)printf("%d ",T[i]);
}