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

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


const int MAX_N = 100100;
const int MAX_M = 500100;

int n, m;
int grade[MAX_N];

bool vis[MAX_M];
int x[MAX_M], y[MAX_M];

vector<int> g[MAX_N];

stack<int> sk;

int main() {
	fin >> n >> m;
	for (int i = 1; i <= m; ++i) {
		fin >> x[i] >> y[i];
		g[x[i]].push_back(i);
		g[y[i]].push_back(i);
		++grade[x[i]]; ++grade[y[i]];
	}
	fin.close();
	
	for (int i = 1; i <= n; ++i)
		if (grade[i] & 1) {
			fout << "-1\n";
			fout.close();
			return 0;
		}
	
	sk.push(1);
	while (sk.size()) {
start:
		int node = sk.top();
		
		while (g[node].size()) {
			int i = g[node][g[node].size() - 1];
			g[node].pop_back();
			
			if (!vis[i]) {
				vis[i] = true;
				sk.push(x[i] + y[i] - node);
				goto start;
			}
		}
		
		if (!g[node].size()) {
			fout << node << ' ';
			sk.pop();
		}
	}
	
	fout.close();
	
}