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

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


const int NMAX = 100005, MMAX = 500005;

array<vector<int>, NMAX> lista;
int from[MMAX], to[MMAX];

int n, m;

bool sters[MMAX];

int main()
{
    int i, j;

    fin>>n>>m;

    int x, y;
    for(i=0; i<m; i++)
    {
        fin>>x>>y;
        lista[x].push_back(i);
        lista[y].push_back(i);
        from[i] = x;
        to[i] = y;
    }

    auto e_impar = [](const vector<int>& v)
    {
        return (v.size()%2);
    };

    int nr_impare = count_if(lista.begin(), lista.end(), e_impar);

    if(nr_impare != 0)
    {
        fout<<"-1\n";
        return 0;
    }

    vector<int> rez;
    stack<int> st;

    st.push(1);
    int nod;
    while(!st.empty())
    {
        nod = st.top();
        if(!lista[nod].empty())
        {
            int e = lista[nod].back();
            lista[nod].pop_back();
            if(!sters[e])
            {
                sters[e] = true;
                int dest = to[e] ^ from[e] ^ nod;
                st.push(dest);
            }
        }
        else
        {
            rez.push_back(nod);
            st.pop();
        }
    }

    for(i=0; i < rez.size() - 1; i++)
    {
        fout<<rez[i]<<' ';
    }

    fin.close();
    fout.close();
    return 0;
}