#include <fstream>
#include <vector>
#include <bitset>

using namespace std;

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

int n, m, X[500001], Y[500001];

vector <int> ans, a[100001];

bitset <500001> viz;

inline void euler(int nod)
{
    for (auto it : a[nod]) {
        if (!viz[it]) {
            viz[it] = 1;
            euler(X[it] + Y[it] - nod);
        }
    }

    ans.push_back(nod);
}

int main()
{
    f >> n >> m;

    for (int i = 1; i <= m; ++i) {
        f >> X[i] >> Y[i];

        a[X[i]].push_back(i);
        a[Y[i]].push_back(i);
    }

    for (int i = 1; i <= n; ++i) {
        if (a[i].size() % 2) {
            g << -1;
            return 0;
        }
    }

    euler(1);

    for (int i = 0; i < (int) ans.size() - 1; ++i) {
        g << ans[i] << ' ';
    }

    return 0;
}