#include <bits/stdc++.h>
#define Nmax 100005
#define Mmax 500005
using namespace std;

ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");

int N, M;
bool vis[Mmax];
vector<int> ans;
vector<pair<int, int> > G[Nmax];

void DFS(int node) {
    while (!G[node].empty()) {
         int nxt = G[node].back().first, edge = G[node].back().second;
         G[node].pop_back();
         if (!vis[edge]) {
               vis[edge] = 1;
               DFS(nxt);
         }
    }
      ans.push_back(node);
}
int main()
{
    fin >> N >> M;
    for (int i = 1; i <= M; ++i) {
        int x, y;
        fin >> x >> y;
        G[x].push_back({y, i});
        G[y].push_back({x, i});
    }
    for (int i = 1; i <= N; ++i)
    if (G[i].size() % 2) {
         fout << -1;
         return 0;
    }

    DFS(1);
    ans.pop_back();
    for (auto it: ans)
        fout << it << " ";

    return 0;
}