#include <fstream>

using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
struct nod
{
    int val;
    nod *urm;
};
typedef nod *pnod;
pnod v[100010],p;
int n,m,t[500010];
void ad(int x,int y)
{
    p=new nod;
    p->urm=v[x]->urm;
    p->val=y;
    v[x]->urm=p;
    v[x]->val+=1;
}
int k;
void sterge(int x,int y)
{
    p=v[x];
    while(p->urm and p->urm->val!=y)
    {
        p=p->urm;
    }
    p->urm=p->urm->urm;
}
void euler()
{
    int nod,nod2;
    while(k>0)
    {
        nod=t[k];
        if(v[nod]->val)
        {
            nod2=v[nod]->urm->val;
            sterge(nod,nod2);
            sterge(nod2,nod);
            v[nod]->val-=1;
            v[nod2]->val-=1;
            t[++k]=nod2;
        }
        else
        {
            k--;
            if(k)
                g<<t[k]<<" ";
        }
    }
}
bool bun()
{
    int i;
    for(i=1;i<=n;i++)
        if(v[i]->val%2==1)
            return 0;
    return 1;
}
bool viz[100003];
bool conex()
{
    t[1]=1;
    int k=1,s=1;
    viz[1]=1;
    while(k<=s)
    {
        p=v[t[k]]->urm;
        while(p)
        {
            if(viz[p->val]==0)
            {
                viz[p->val]=1;
                s+=1;
                t[s]=p->val;
            }
            p=p->urm;
        }
        k+=1;
    }
    if(s==n)
        return 1;
    return 0;
}
int main()
{
    int i,x,y;
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        v[i]=new nod;
        v[i]->val=0;
        v[i]->urm=0;
    }
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        ad(x,y);
        ad(y,x);
    }
    if(bun()==0)
        g<<"-1";
    else
        if(conex()==0)
            g<<"-1";
        else
        {
            k=1;
            euler();
        }
    return 0;
}