// Ciclu eulerian - O(N+M) - RECURSIV
#include <fstream>
#include <bitset>
#include <vector>
#define Nmax 100009
#define Mmax 500009
#define pb push_back
#define x first
#define y second
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
typedef pair<int,int> PP;
int N,M,x,y;
vector < int > G[Nmax],Cycle;
PP E[Mmax];
bitset < Mmax > viz;

inline int IsEulerian()
{
     for(int i=1;i<=N;++i)
          if(G[i].size()&1)return 0;
     return 1;
}

inline void DFS(int node)
{
     for(vector < int >::iterator it=G[node].begin();it!=G[node].end();++it)
          if(!viz[*it]) viz[*it]=1 , DFS(E[*it].x+E[*it].y-node);
     Cycle.pb(node);
}

int main()
{
     f>>N>>M;
     for(int i=1;i<=M;++i)
        f>>x>>y , G[x].pb(i) , G[y].pb(i) , E[i]=PP(x,y);
     if(IsEulerian())
     {
        DFS(1);
        for(vector< int > ::iterator it=Cycle.begin();it!=Cycle.end();++it)
            g<<*it<<' ';
        g<<'\n';
     }
     else g<<-1<<'\n';
     f.close();g.close();
     return 0;
}