#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;

ifstream f ("ciclueuler.in");
ofstream g ("ciclueuler.out");

const int NMAX = 100000;

int n;
int stiva[NMAX + 1];
int grad[NMAX + 1];
bool vizitat[NMAX + 1];
vector <int> graf[NMAX + 1];

void citeste() {
	int e, a, b;
	f >> n >> e;
	for (int i = 1; i <= e; i++) {
		f >> a >> b;
		graf[a].push_back(b);
		graf[b].push_back(a);
		grad[a]++;
		grad[b]++;
	}
}

bool sunt_grade_pare() {
	for (int i = 1; i <= n; i++)
		if (grad[i] % 2) return false; 
	return true;
}

void DFS(int nod) {
	if (vizitat[nod]) return;
	vizitat[nod] = true;
	int l = graf[nod].size();
	for (int i = 0; i < l; i++)
		DFS(graf[nod][i]);
}

bool e_conex() {
	DFS(1);
	for (int i = 1; i <= n; i++)
		if (!vizitat[i]) return false;
	return true;
}

void euler() {
	int nod, l, fiu, top = 0;
	stiva[++top] = 1;

	while (top > 0) {
		nod = stiva[top];
		l = graf[nod].size();
		
		if (l == 0) {
			g << nod << ' ';
			top--;
			continue;
		}
		
		fiu = graf[nod][l - 1];
		graf[nod].pop_back();
		graf[fiu].erase(find(graf[fiu].begin(), graf[fiu].end(), nod));
		stiva[++top] = fiu;
	}
}

int main() {
	citeste();
	if (sunt_grade_pare() && e_conex()) {
		euler();
		g << '\n';
	}
	else {
		g << "-1\n";
	}
	return 0;
}