#include <bits/stdc++.h>
#define DMAX 100005
#define NMAX 500005

using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
list<int> LA[DMAX];
int n;
void citire();
bool verif();
void DFS1(int x);
int main()
{
    citire();
    if(verif())
       {DFS1(1);fout<<'\n';}
       else
       fout<<"-1"<<'\n';
    return 0;
}
void citire()
{int a,b,M,i;
    fin>>n;
    fin>>M;
    for(i=1;i<=M;i++)
         {
          fin>>a>>b;
          LA[a].push_back(b);
          LA[b].push_back(a);
         }
}
bool verif()
{int i;
   for(i=1;i<=n;i++)
       {
        if(LA[i].size()%2)
           return 0;
       }
   return 1;
}
void DFS1(int x)
{int nod;
    while(!LA[x].empty())
        {nod=LA[x].front();
         LA[x].pop_front();
         LA[nod].erase(find(LA[nod].begin(),LA[nod].end(),x));
         DFS1(nod);
        }
    fout<<x<<' ';
}