#include <fstream>
#include <iostream>
#include <vector>
using namespace std;

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

pair <int, int> much[500001];
vector <int> v[100001];
bool okd[100001], okm[500001];

void dfs (int r)
{
	okd[r] = 1;
	int i;
	for (i = 0; i<v[r].size(); i++)
		if (okd[much[v[r][i]].first ^ much[v[r][i]].second ^ r] == 0)
			dfs (much[v[r][i]].first ^ much[v[r][i]].second ^ r);
}

int s[500001], rasp[500001];

int main()
{
	int n, m, i, x, y;
	fin >> n >> m;
	for (i = 1; i<=m; i++)
	{
		fin >> x >> y;
		much[i] = {x, y};
		v[x].push_back (i);
		v[y].push_back (i);
	}
	
	dfs (1);
	for (i = 1; i<=n; i++)
		if (okd[i] == 0 || (v[i].size() & 1))
		{
			fout << -1;
			return 0;
		}
	
	s[0] = s[1] = 1;
	while (s[0] > 0)
	{
		x = s[s[0]];
		if (v[x].empty() == 0)
		{
			y = v[x].back();
			v[x].pop_back();
			if (okm[y] == 0) //muchia nu a fost folosita deja
			{
				okm[y] = 1;
				s[++s[0]] = much[y].first ^ much[y].second ^ x;
			}
		}
		else
		{
			rasp[++rasp[0]] = x;
			s[0]--;
		}
	}
	for (i = 1; i<rasp[0]; i++)
		fout << rasp[i] << ' ';
	return 0;
}