#include <bits/stdc++.h>
using namespace std;

const int NMAX = 1e5 + 5;
const int MMAX = 5e5 + 5;

int n, m;
vector < pair<int, int> > G[NMAX];
bool ok[MMAX];
bool viz[NMAX];
int deg[NMAX];
vector <int> rez;
int Q[NMAX];
int st, dr;

void bfsCheck()
{
    st = dr = 1;
    Q[1] = 1;
    viz[1] = 1;

    while (st <= dr)
    {
        int nod = Q[st++];
        for (auto v: G[nod])
        {
            if (!viz[v.first])
            {
                Q[++dr] = v.first;
                viz[v.first] = 1;
            }
        }
    }
}

void dfs(int nod)
{
    rez.push_back(nod);
    for (auto v: G[nod])
    {
        if (ok[v.second])
        {
            ok[v.second] = 0;
            dfs(v.first);
        }
    }
}

int main()
{
    FILE *fi, *fo;
    fi = fopen("ciclueuler.in", "r");
    fo = fopen("ciclueuler.out", "w");

    fscanf(fi, "%d%d", &n, &m);
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        fscanf(fi, "%d%d", &u, &v);
        G[u].push_back({v, i});
        G[v].push_back({u, i});
        ok[i] = 1;
        deg[u]++;
        deg[v]++;
    }

    bool euler = 1;
    for (int i = 1; i <= n; i++)
        if (deg[i] % 2 == 1)
            euler = 0;

    bfsCheck();
    for (int i = 1; i <= n; i++)
        if (!viz[i])
            euler = 0;

    if (!euler)
    {
        fprintf(fo, "-1");
        return 0;
    }

    dfs(1);
    rez.pop_back();
    for (auto x: rez)
        fprintf(fo, "%d ", x);

    return 0;
}