#include <iostream>
#include <vector>
#include <stack>
#include <algorithm>
#define NMAX 100005
#include <fstream>
#include <list>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int n,m,i,x,y;
list <int> v[NMAX],ans;
stack <int> st;
void euler(int node)
{
    st.push(node);
    while(!st.empty())
    {
        int curr=st.top();
        if(v[curr].size())
        {
            int next=v[curr].front();
            v[curr].pop_front();
            st.push(next);
            v[next].erase(find(v[next].begin(),v[next].end(),curr));
        }
        else
        {
            ans.push_back(curr);
            st.pop();
        }
    }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(i=1;i<=n;i++)
    {
        if(v[i].size()==0 || v[i].size()%2 ==1)
        {
            g<<-1;
            return 0;
        }
    }
    euler(1);
    //int cnt=ans.size()-1;
    ans.pop_back();
    for(auto & it : ans)
    {
        g<<it<<" ";
    }
    return 0;
}