#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define mp make_pair
#define CHECK(x) if(!(x)) return false;
#define CHECKRET(x, y) if(!(x)) return (y);
#define SKIP(x) if((x)) continue;
typedef pair<int, int> pii;

#ifdef INFOARENA
#define ProblemName "ciclueuler"
#endif

#define MCONCAT(A, B) A B
#ifdef ProblemName
#define InFile MCONCAT(ProblemName, ".in")
#define OuFile MCONCAT(ProblemName, ".out")
#else
#define InFile "fis.in"
#define OuFile "fis.out"
#endif

const int MAXN = 100010;
const int MAXM = 500010;
int nxt[MAXM * 2], G[MAXN];
bool impar[MAXN];
vector<int> ciclu;
int to[MAXM * 2];
bool done[MAXM * 2];

void DFS(int x) {
  while (G[x] >= 0) {
    int iy = G[x]; G[x] = nxt[G[x]];
    SKIP(done[iy]);
    done[iy] = done[iy ^ 1] = true;
    DFS(to[iy]);
  }
  ciclu.push_back(x);
}

int main() {
  assert(freopen(InFile, "r", stdin));
  assert(freopen(OuFile, "w", stdout));
  memset(G, 0xFF, sizeof G);
  int N, M;
  scanf("%d%d", &N, &M);
  for (int i = 0; i < M; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    --x, --y;
    impar[x] = !impar[x];
    impar[y] = !impar[y];
    to[2 * i] = y; nxt[2 * i] = G[x]; G[x] = 2 * i;
    to[2 * i + 1] = x; nxt[2 * i + 1] = G[y]; G[y] = 2 * i + 1;
  }
  for (int i = 0; i < N; ++i)
    if (G[i] == NULL || impar[i]) {
      puts("-1");
      return 0;
    }
  DFS(0);
  ciclu.pop_back();
  for (const auto &it : ciclu)
    printf("%d ", it + 1);
  puts("");

  return 0;
}