#include<fstream>
#include<vector>
#include<stack>
#include<algorithm>
using namespace std;

ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");

vector<int> v[100010];
int grad[100010];
int freq[10000], n, m;
stack<int> st;


void dfs(int nod)
{
	freq[nod] = 1;
	for (int i = 0; i < v[nod].size(); i++)
		if (freq[v[nod][i]] == 0)
			dfs(v[nod][i]);
}

bool conex()
{
	dfs(1);
	for (int i = 1; i < n; i++)
		if (freq[i] == 0)
			return false;
	return true;
}

bool gradpar()
{
	for (int i = 1; i <= n; ++i)
		if (grad[i] % 2 != 0)
			return false;
	return true;
}
void cautaciclu()
{
	st.push(1);
	while (!st.empty())
	{
		int aux = st.top();
		if (v[aux].size())
		{
			int nod = v[aux].back(); v[aux].pop_back();
			st.push(nod);
			v[nod].erase(find(v[nod].begin(), v[nod].end(), aux));
		}
		else
		{
			st.pop();
			if (!st.empty())
				fout << aux << " ";
		}
	}

}
int main()
{
	int a, b;
	fin >> n >> m;
	for (int i = 1; i <= m; ++i)
	{
		fin >> a >> b;
		grad[a]++; grad[b]++;
		v[a].push_back(b); v[b].push_back(a);
	}
	if (conex() && gradpar())
	{
		cautaciclu();
	}
	else
		fout << "-1";
		//cout << "Nu exista ciclu!\n";
//	system("pause");


	return 0;
}