#include<stdio.h>
#include<stdlib.h>
#define N 100001
#define M 500001
typedef struct stack
{long st[N],sp;};
typedef struct nod
{long info;
nod *next;}Nod,*list;
long a[M],b[M],i,j,k,n,m,s[N]={0},t=0,u,c[M]={0},r,p[N],w,v;
list g[N];
stack q;

void push(stack &q,long x)
{q.st[++q.sp]=x;}

long pop(stack &q)
{return q.st[q.sp--];}

void add(list &q,long x)
{Nod *nou=new Nod;
nou->info=x;
nou->next=q;
q=nou;}
     
int grade_pare(list g[N],long n)
{long i=1,s=0;
list p;
int gasit=0;
while(i<=n&&!gasit)
      {for(p=g[i];p!=NULL;p=p->next)
             s++;
      if(s%2==1)
             gasit=1;
      i++;}
return (!gasit);}

void df(list g[N],long i)
{long j;
list p;
stack q;
q.sp=0;
push(q,i);
while(q.sp!=0)
       {j=pop(q);
       s[j]=1;
       for(p=g[j];p!=NULL;p=p->next)
       if(s[p->info]==0)
              push(q,p->info);}}

int conex(list g[N],long s[N])
{long i;
int gasit=0;
df(g,1);
for(i=1;i<=n;i++)
if(s[i]==0)
      gasit=1;
return (!gasit);}

void dfs(long a[M],long b[M],long i,long t,long p[N])
{long j;
t++;
if(t<=m)
      printf("%ld ",i);
for(j=m;j>=1;j--)
if(a[j]==i&&c[j]==0)
      {c[j]=1;
      p[b[j]]=i;
      dfs(a,b,b[j],t,p);}
else
      if(b[j]==i&&c[j]==0)
              {c[j]=1;
              p[a[j]]=i;
              dfs(a,b,a[j],t,p);}}

int main()
{freopen("ciclueuler.in","r",stdin);
freopen("ciclueuler.out","w",stdout);
scanf("%ld%ld\n",&n,&m);
for(j=1;j<=n;j++)
      {g[j]=NULL;
      p[j]=0;}
for(i=1;i<=m;i++)
      {scanf("%ld%ld\n",&a[i],&b[i]);
      add(g[a[i]],b[i]);
      add(g[b[i]],a[i]);}
if(conex(g,s)==1&&grade_pare(g,n)==1)
      dfs(a,b,1,t,p);
else
      printf("-1");
fclose(stdin);
fclose(stdout);
return 0;}