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

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

int n, m;
vector<int> g[100001];
vector<int> st;
vector<int> ciclu;

bool eulerian() {
    for (int i = 1; i <= n; ++i)
        if (g[i].size() % 2 != 0) return false;
    return true;
}

void remove_edge(int x, int y) {
    g[x].erase(find(g[x].begin(), g[x].end(), y));
    g[y].erase(find(g[y].begin(), g[y].end(), x));
}

void euler(int x) {
    st.push_back(x);

    while (st.size()) {
        x = st.back();
        while(g[x].size()) {
            int y = g[x][0];
            remove_edge(x, y);
            st.push_back(y);
            x = y;
        }
        ciclu.push_back(x);
        st.pop_back();
    }
}

int main() {

    in >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int x, y;
        in >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }

    if (!eulerian()) {
        out << -1;
        return 0;
    }

    euler(1);

    for (int i = ciclu.size() - 1; i > 0; --i)
        out << ciclu[i] << " ";

    return 0;
}