#include<cstdio>
#include<algorithm>
#include<vector>
#include<deque>
using namespace std;
vector<int> a[100002];
vector<int>::iterator it;
deque<int> q;
int n,m,i,x,y,ok;
void euler(int nd)
{ int nod,nod2;
	q.push_front(nd);
	while(!q.empty())
	{
		nod=q.front();
		if(a[nod].size()==0)
		{
			printf("%d ",nod);
			q.pop_front();
			continue;
		}
	   nod2=a[nod].back();
	   a[nod].pop_back();
	   q.push_front(nod2);
	  for(it=a[nod2].begin();it!=a[nod2].end();it++)
	  if(*it==nod)
	  {
		  a[nod2].erase(it);
		  break;
	  }
	}
}
int main()
{
	freopen("ciclueuler.in","r",stdin);freopen("ciclueuler.out","w",stdout);
	scanf("%d %d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d %d",&x,&y);
		a[x].push_back(y);
		a[y].push_back(x);
    }
	ok=1;
	for(i=1;i<=n;i++) if(a[i].size()%2)ok=0;
	
	if(!ok)printf("-1\n");
	 else  euler(1);
return 0;}