#include <fstream>
using namespace std;

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

typedef struct nod
{
    int inf,i;
    nod *urm;
} NOD;
typedef NOD *graf[100010];
graf G;

typedef struct queue
{
    int inf;
    queue *previous;
} QUEUE;

QUEUE *q;
int n,m,v[500010],viz[100010],M[500010],x,nr;

void citire()
{
    f>>n>>m;
    for(int i=0;i<m;i++)
    {
        int a,b;
        f>>a>>b;
        NOD *p=new NOD;p->inf=a;p->i=i+1;p->urm=G[b];G[b]=p;
        p=new NOD;p->inf=b;p->i=i+1;p->urm=G[a];G[a]=p;
    }
    f.close();
}

void del(int x,int y)
{
    if(G[x]->inf==y)
    {
        G[x]=G[x]->urm;
        return;
    }
    NOD *aux=G[x];
    for(NOD *j=G[x]->urm;j;j=j->urm)
    {
        if(j->inf==y)
        {
            aux->urm=j->urm;
            delete j;
            return ;
        }
        aux=j;
    }
}

void DF()
{
    q=new QUEUE;q->inf=1;q->previous=NULL;
while(q)
{
    int i=q->inf;
    if(!viz[i]){ viz[i]=1;nr++;}
    if(G[i])
    {
        QUEUE *p=new QUEUE;
        p->inf=G[i]->inf;
        del(G[i]->inf,i);
        G[i]=G[i]->urm;
        p->previous=q;q=p;
    }
    else
    {
        M[++x]=i;
        q=q->previous;
    }
}
}
int main()
{
    citire();
    DF();
    if(x<m||nr<n)
    {
        g<<-1<<'\n';
        return 0;
    }
    for(int i=1;i<=m;i++)
        g<<M[i]<<' ';
    g<<'\n';
    return 0;
}