#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;
ifstream cin("ciclueuler.in");
ofstream cout("ciclueuler.out");
#define MAXN 100005

vector<int> graf[MAXN];
stack<int> st;
int n,m,i,j,x,y,nod,urm;
bool euler = true;

int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        graf[x].push_back(y);
        graf[y].push_back(x);
    }

    for(i=1; i<=n; i++)
        if(!graf[i].size() || graf[i].size() % 2 )
            euler = false;

    if(!euler)
    {
        cout<<-1;
        return 0;
    }

    st.push(1);
    while(!st.empty())
    {
        nod=st.top();
        if(!graf[nod].size())
        {
            st.pop();
            if(!st.empty())
                cout<<nod<<" ";
        }
        else
        {
            urm = graf[nod].back();
            graf[nod].pop_back();
            graf[urm].erase( find(graf[urm].begin(), graf[urm].end(), nod) );
            st.push( urm );
        }
    }
    return 0;
}