# include <iostream>
# include <fstream>
# include <algorithm>
# include <vector>
# include <bitset>
# include <stack>
using namespace std;

# define MAXN 100010
# define MAXM 500010
typedef vector< pair<int, int> >::iterator iter;

FILE *f = fopen("ciclueuler.in", "r");
FILE *g = fopen("ciclueuler.out", "w");

int n, m;
vector< pair<int, int> > G[MAXN];
bitset<MAXM> vizmuchie;
vector<int> sol;
int grd[MAXN];
stack<int> stiva;

bool iseuler() {
    for (int i = 1; i <= n; i++) {
        if (grd[i] & 1 == 1) {
            return false;
        }
    }
    return true;
}

void euler() {
    stiva.push(1);
    while (stiva.empty() == false) {
        int nd = stiva.top();

        if (!G[nd].empty()) {
            stiva.push(G[nd][0].first);
            G[G[nd][0].first].erase(find(G[G[nd][0].first].begin(), G[G[nd][0].first].end(), make_pair(nd, G[nd][0].second)));
            G[nd].erase(find(G[nd].begin(), G[nd].end(), make_pair(G[nd][0].first, G[nd][0].second)));
            continue;
        }

        /*bool ok = false;
        for (iter it = G[nd].begin(); it != G[nd].end(); it++) {
            if (vizmuchie[it->second] == false) {
                vizmuchie[it->second] = true;
                stiva.push(it->first);
                ok = true;
                break;
            }
        }

        if (ok == true) {
            continue;
        }*/
        sol.push_back(nd);
        stiva.pop();
    }
}

int main()
{
    fscanf(f, "%d %d\n", &n, &m);
    for (int i = 1; i <= m; i++) {
        int x, y;
        fscanf(f, "%d %d\n", &x, &y);

        G[x].push_back(make_pair(y, i));
        G[y].push_back(make_pair(x, i));

        grd[x] ++;
        grd[y] ++;
    }

    if (iseuler() == true) {
        euler();
        sol.pop_back();

        for (vector<int>::iterator it = sol.begin(); it != sol.end(); it++) {
            fprintf(g, "%d ", *it);
        }
    } else {
        fprintf(g, "-1");
    }

    fclose(f);
    fclose(g);
    return 0;
}