#include <bits/stdc++.h>

using namespace std;

const int Nmax = 100001;
const int Mmax = 500001;

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

int n, m;

vector<pair<int, int>> graf[Nmax];
bitset<Mmax> seenMuchie;
bitset<Nmax> seenNod;

bool isEulerian = true;

vector<int> eulerianCycle;
void dfs(int nod)
{
    //cout << nod << " ";

    seenNod[nod] = 1;

    if(isEulerian)
    {
        //cout << "lol";
        while(!graf[nod].empty())
        {
            auto x = graf[nod].back();

            graf[nod].pop_back(); // O(1)

            if(!seenMuchie[x.second])
            {
                seenMuchie[x.second] = 1;
                dfs(x.first);
            }
        }
        eulerianCycle.push_back(nod);
    }

}

int main()
{
    fin >> n >> m;
    int x, y;
    for(int i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        graf[x].push_back({y, i});
        graf[y].push_back({x, i});
    }

    for(int nod = 1; nod <= n; ++nod)
        if((int)(graf[nod].size()) % 2 == 1)
            isEulerian = false;

    dfs(1);

    for(int i = 1; i <= n; ++i)
        if(seenNod[i] == 0)
            isEulerian = false;

    if(isEulerian)
    {
        for(int i = 0; i < (int)eulerianCycle.size() - 1; ++i)
            fout << eulerianCycle[i] << " ";
    }
    else
        fout << "-1";

    return 0;
}