#include<bits/stdc++.h>
#define Yukinoshita namespace
#define Yukino std
using Yukinoshita Yukino;
int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') w=ch=='-'?-1:1,ch=getchar();
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
const int mxn=3e5+5;
vector<int> a[mxn];
unordered_set<int> b[mxn];
bool vis[mxn];
int ans[mxn];
int n,m;
void sf(list<int> &u)
{
	static int a[mxn];
	int cnt=0;
	for(auto x:u)
		a[++cnt]=x;
	random_shuffle(a+1,a+1+cnt);
	u.clear();
	for(;cnt;cnt--) u.push_back(a[cnt]);
}
void solve1()//有连边-无连边 
{
	memset(vis,0,n+1);
	vis[1]=1;
	int i,j,p=1,cnt=0;
	bool tp=0;
	list<int> u;
	for(i=2;i<=n;i++)
	{
		random_shuffle(a[p].begin(),a[p].end());
		bool fl=0;
		if(!tp)
		{
			for(auto x:a[p])
				if(!vis[x])
				{
					fl=1;
					p=x;
					break;
				}
			if(!fl)
			{
				tp=1;
				for(j=1;j<=n;j++)
					if(!vis[j])
						u.push_back(j);
				sf(u);
			}	
		}
		if(tp)
		{
			for(auto x=u.begin();x!=u.end();x++)
				if(!b[p].count(*x))
				{
					p=*x;
					fl=1;
					u.erase(x);
					break;
				}
			if(u.size()&&rand()%u.size()<=5) sf(u);
			swap(*u.begin(),u.back());
		}
		if(!fl) return;
		ans[i]=p,vis[p]=1;
	}
	for(i=1;i<=n;i++)
		printf("%d ",ans[i]);
	exit(0);
}
void solve2()//无连边-有连边 
{
	memset(vis,0,n+1);
	vis[1]=1;
	int i,j,p=1,cnt=0;
	bool tp=0;
	list<int> u;
	for(j=2;j<=n;j++)
		u.push_back(j);
	sf(u);
	for(i=2;i<=n;i++)
	{
		random_shuffle(a[p].begin(),a[p].end());
		bool fl=0;
		if(!tp)
		{
			for(auto x=u.begin();x!=u.end();x++)
				if(!b[p].count(*x))
				{
					p=*x;
					fl=1;
					u.erase(x);
					break;
				}
			if(!fl)
				tp=1;
		}
		if(tp)
		{
			for(auto x:a[p])
				if(!vis[x])
				{
					fl=1;
					p=x;
					break;
				}
			if(u.size()&&rand()%u.size()<=5) sf(u);
			swap(*u.begin(),u.back());
		}
		if(!fl) return;
		ans[i]=p,vis[p]=1;
	}
	for(i=1;i<=n;i++)
		printf("%d ",ans[i]);
	exit(0);
}
int main()
{
	ans[1]=1;
	n=read(),m=read();
	while(m--)
	{
		int x=read(),y=read();
		a[x].push_back(y);
		a[y].push_back(x);
	}
	for(int i=1;i<=n;i++)
		for(auto x:a[i])
			b[i].insert(x);
	for(;;)
		solve1(),solve2();
}