#include <iostream>
#include <fstream>
#include <vector>
#define N 100010

using namespace std;

ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");

vector<int> vec[N];
vector<int> stk;
vector<int> ans;
bool uzat[N];
int i,j,n,m,k,t,p,r,from[N],to[N];

int main()
{
    int x,y;
    f>>n>>m;
    for(i=0;i<m;i++)
    {
        f>>x>>y;
        vec[x].push_back(i);
        vec[y].push_back(i);
        from[i]=x;
        to[i]=y;
    }
    for(i=1;i<=n;i++)
    {
        if(vec[i].size()%2!=0)
        {
            g<<"-1"<<"\n";
            return 0;
        }
    }
    stk.push_back(1);
    int nod,vf;
    while(!stk.empty())
    {
        nod=stk.back();
        if(!vec[nod].empty())
        {
            vf=vec[nod].back();
            vec[nod].pop_back();
            if(uzat[vf]==0)
            {
                uzat[vf]=1;
                if(from[vf]==nod)
                    stk.push_back(to[vf]);
                else
                    stk.push_back(from[vf]);
            }
        }
        else
        {
            ans.push_back(nod);
            stk.pop_back();
        }
    }
    for(i=0;i<ans.size()-1;i++)
        g<<ans[i]<<' ';
}