#include <vector>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
using namespace std;

#define nmax 100010

vector<int> G[nmax];
vector<int> sol;
int n, m, x, y;

void read_input()
{
     scanf("%i %i", &n, &m);
     char s[15];
     for(int i = 0; i < m; i++)
     {
              scanf("%i %i", &x, &y);  
              G[x].push_back(y);
              G[y].push_back(x);
     }
}

bool Eulerian()
{
     for(int i = 1; i <= n; i++) if(G[i].size() % 2) return false;
     return true;
}

void euler()
{
     int node;
     stack <int> s;
     s.push(1);
     while(!s.empty())
     {
                      node = s.top();
                      if(G[node].size() == 0)
                      {
                                        sol.push_back(node);
                                        s.pop();
                      }else
                      {
                           int last = G[node].back();
                           G[node].pop_back();
                           s.push(last);
                           for(int i = 0; i < G[last].size(); i++)
                           {
                                 if(G[last][i] == node)
                                 {
                                               G[last][i] = G[last].back();
                                               G[last].pop_back();
                                               break;
                                 }
                           }
                      }     
     }
     for(int i = 0; i < sol.size() - 1; i++) printf("%i ", sol[i]);
     printf("\n");
}

int main()
{
    freopen("ciclueuler.in", "r", stdin);
    freopen("ciclueuler.out", "w", stdout);
    int i;
    read_input();
    if(Eulerian() == true) euler();
    else printf("-1\n");
    scanf("%i", &i);
    return 0;
}