#include <bits/stdc++.h>
#define edge pair<int, int>
#define number first
#define node second
#define oo 0x3f3f3f3f 

using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int n, m, x, y;
vector<edge> graf[100001];
vector<int> result;
bool eliminat[500001];

void read()
{
  f>>n>>m;
  for(int i = 1;i <= m;++i)
    f>>x>>y, graf[x].push_back(make_pair(i, y)), graf[y].push_back(make_pair(i, x));
}

void euler()
{
  for(int i = 1;i <= n;++i)
    if(graf[x].size() & 1)
      {
        g<<-1<<'\n';
        return;
      }
  
  stack<int> s;
  s.push(1);

  while(!s.empty())
  {
    int node = s.top();

    if(!graf[node].empty())
    {
      edge e = graf[node].back();
      graf[node].pop_back();

      if(!eliminat[e.number])
        {
          eliminat[e.number] = true;
          s.push(e.node);
        }
    }
    else
    {
      s.pop();
      result.push_back(node);
    }
  }
  for(auto it : result)
    g<<it<<" ";
}

int main()
{
  read();
  euler();
  return 0;
}