#include <bits/stdc++.h>

using namespace std;

const int NMax = 100005;

int n,m,top,ctc_nr,x,y;
int viz[5 * NMax],grad[NMax];
vector<pair<int,int> > G[NMax];
stack<int> st;

int main(){
    ifstream cin("ciclueuler.in");
    ofstream cout("ciclueuler.out");
    cin >> n >> m;
    for(int i = 1; i <= m; ++i){
        cin >> x >> y;
        G[x].push_back(make_pair(y,i));
        G[y].push_back(make_pair(x,i));
        grad[x]++;
        grad[y]++;
    }
    for(int i = 1; i <= n; ++i){
        if(grad[i] % 2 != 0){
            cout << -1 << '\n';
            return 0;
        }
    }
    st.push(1);
    int nr = 0;
    while(!st.empty()){
        int curr = st.top();
        while(G[curr].size() > 0 && viz[G[curr].back().second] == 1){
            G[curr].pop_back();
        }
        if(G[curr].size() == 0){
            if(nr++ >= m){
                return 0;
            }
            cout << curr << ' ';
            st.pop();
        }else{
            int nei = G[curr].back().first;
            viz[G[curr].back().second] = 1;
            G[curr].pop_back();
            st.push(nei);
        }
    }

    return 0;
}