#include <bits/stdc++.h>

using namespace std;

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

void usain_bolt()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
}

const int N = 1e5 + 5;

vector < int > sol;
stack < int > st;
list < int > a[N];
int degree[N];

int main()
{
    usain_bolt();

    int n, m;

    fin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int x, y;

        fin
         >> x >> y;
        a[x].push_back(y);
        a[y].push_back(x);
        ++degree[x], ++degree[y];
    }
    for(int i = 1; i <= n; ++i) {
        if(degree[i] % 2 == 1 || degree[i] == 0) {
            fout << -1 << "\n";
            return 0;
        }
    }
    st.push(1);
    while(!st.empty()) {
        int top = st.top();
        if((int) a[top].size() > 0) {
            int v = *a[top].begin();
            list < int > ::iterator it = find(a[v].begin(), a[v].end(), top);
            a[top].erase(a[top].begin());
            a[v].erase(it);
            st.push(v);
        }
        else {
            sol.push_back(top);
            st.pop();
        }
    }
    sol.pop_back();
    for(auto v : sol) {
        fout << v << " ";
    }
    return 0;
}