#include <bits/stdc++.h>
#define NMAX 100005
#define MMAX 500005
#define pii pair <int, int>
#define INF 0x3f3f3f3f

using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");

int N, M, start;
int viz[MMAX], tip[MMAX], h[NMAX];
vector <pii> v[NMAX];
stack <int> st;

void dfs(int nod)
{
    vector <pii> :: iterator it;
    for (it = v[nod].begin(); it != v[nod].end(); it++)
    {
        pii nxt = *it;
        if (viz[nxt.second] == 0)
        {
            if (h[nxt.first] < h[nod])
                tip[nxt.second] = 2;
            else tip[nxt.second] = 1;
            viz[nxt.second] = 1;
            h[nxt.first] = min(h[nod] + 1, h[nxt.first]);
            dfs(nxt.first);
        }
    }
}

void rec(int nod)
{
    vector <pii> :: iterator it;
    /// FATA
    for (it = v[nod].begin(); it != v[nod].end(); it++)
    {
        pii nxt = *it;
        if (viz[nxt.second] == 0 && tip[nxt.second] == 1)
        {
            viz[nxt.second] = 1;
            rec(nxt.first);
        }
    }
    /// SPATE
    for (it = v[nod].begin(); it != v[nod].end(); it++)
    {
        pii nxt = *it;
        if (viz[nxt.second] == 0 && tip[nxt.second] == 2)
        {
            viz[nxt.second] = 1;
            rec(nxt.first);
        }
    }
    st.push(nod);
}

int main()
{
    fin >> N >> M;
    for (int i = 1; i <= M; i++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back({y, i});
        v[y].push_back({x, i});
    }
    for (int i = 1; i <= N; i++)
    {
        if (v[i].size() % 2 != 0)
        {
            fout << "-1\n";
            return 0;
        }
    }
    for (int i = 2; i <= N; i++)
        h[i] = INF;
    h[1] = 1;
    dfs(1);
    for (int i = 1; i <= M; i++)
        viz[i] = 0;
    rec(1);
    while (st.size() != 1)
    {
        fout << st.top() << " ";
        st.pop();
    }
    return 0;
}