#include<stdio.h>
#include<vector>
#include<stack>
#define Nmax 100002
using namespace std;
int n,m;

vector< pair <int,int> > g[Nmax];
int nr[Nmax];
char viz[Nmax];
stack<int> st;

void citire()
{
	int i,x,y;
	scanf("%d %d",&n,&m);
	for(i=1;i<=m;++i)
	{
		scanf("%d %d",&x,&y);
		g[x].push_back(make_pair(y,i));
		g[y].push_back(make_pair(x,i));
		++nr[x];
		++nr[y];
	}
}

void dfs()
{
	vector<pair <int,int> >::iterator it;
	int x;
	st.push(1);
	while(st.size())
	{
		x=st.top();
		for(it=g[x].begin();it!=g[x].end();++it)
			if(viz[(*it).second]==0)
			{
				viz[(*it).second]=1;
				st.push((*it).first);
				break;
			}
		if(it==g[x].end())
		{
			if(st.size()>1)
				printf("%d ",x);
			st.pop();
		}
	}
}

int main()
{
	int i,ok;
	freopen("ciclueuler.in","r",stdin);
	freopen("ciclueuler.out","w",stdout);
	citire();
	ok=1;
	for(i=1;i<=n;++i)
		if(nr[i]&1)
		{
			ok=0;
			printf("-1");
			break;
		}
	if(ok)
		dfs();
	fclose(stdin);
	fclose(stdout);
	return 0;
}