#include <fstream>
#include <list>
#include <algorithm>

using namespace std;

ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");

const int nmax = 100005;
int n, m, x, y, i, j;
int stiva[5*nmax], vf;
list <int> ls[nmax];

int main() {
    f >> n >> m;
    while (m--) {
        f >> x >> y;
        ls[x].push_back(y);
        ls[y].push_back(x);
    }
    for (i = 1; i <= n; i++)
        if (ls[i].size()%2) {
            g << -1;
            return 0;
        }

    stiva[vf=1] = 1;
    while (vf > 0) {
        x = stiva[vf];
        while (ls[x].empty() == 0) {
            y = ls[x].front();
            ls[x].pop_front();
            ls[y].erase(find(ls[y].begin(), ls[y].end(), x));
            stiva[++vf] = y;
            x = y;
        }
        g << stiva[vf--] << ' ';
    }

    return 0;
}