#include <fstream>
#include <vector>
#include <stack>

using namespace std;

const char InFile[]="ciclueuler.in";
const char OutFile[]="ciclueuler.out";
const int MaxN=100111;
const int MaxM=500111;

ifstream fin(InFile);
ofstream fout(OutFile);

int N,M,x,y,D[MaxN];
vector<int> G[MaxN];
stack<int> S;

int main()
{
	fin>>N>>M;
	for(register int i=1;i<=M;++i)
	{
		fin>>x>>y;
		G[x].push_back(y);
		G[y].push_back(x);
		++D[x];
		++D[y];
	}
	fin.close();
	
	for(register int i=1;i<=N;++i)
	{
		if(D[i]&1)
		{
			fout<<"-1";
			return 0;
		}
	}
	
	S.push(1);
	while(!S.empty())
	{
		int nod=S.top();
		if(G[nod].size()==0)
		{
			if(S.size()>1)
			{
				fout<<nod<<" ";
			}
			S.pop();
		}
		else
		{
			int e=G[nod].back();
			G[nod].pop_back();
			S.push(e);
			for(register int i=0;i<G[e].size();++i)
			{
				if(G[e][i]==nod)
				{
					G[e][i]=G[e].back();
					G[e].pop_back();
					break;
				}
			}
		}
	}
	fout.close();
	return 0;
}