#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;
//struct str {int nod, muc;};
vector<int> L[100010];
int grad[100010];
int st[100010];
int sol[100010];
int n, m, x, y, vf, nr;

int main() {
    ifstream fin("ciclueuler.in");
    ofstream fout("ciclueuler.out");
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        fin >> x >> y;
        L[x].push_back(y);
        L[y].push_back(x);
        grad[x]++;
        grad[y]++;
    }
    for (int i = 1; i <= n; i++) {
        if (grad[i] % 2 != 0) {
            fout << -1;
            return 0;
        }
    }
    st[++vf] = 1;
    while (vf > 0) {
        int crt = st[vf];
        if (grad[crt] == 0) {
            vf--;
            sol[++nr] = crt;
            continue;
        }
        int vec = L[crt].front();
        st[++vf] = vec;
        grad[crt]--;
        grad[vec]--;
        L[vec].erase(remove(L[vec].begin(), L[vec].end(), crt), L[vec].end());
        L[crt].erase(remove(L[crt].begin(), L[crt].end(), vec), L[crt].end());
    }
    for (int i = 1; i <= nr; i++) {
        fout << sol[i] << " ";
    }
    for (int i = 1; i <= n; i++) {
        L[i].clear();
    }
    return 0;
}