#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define NMX 100002

using namespace std;

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

int n,m, grad[NMX];
vector <pair<int,bool>> g[NMX];
vector <int> cicle;

void input()
{
    f >> n >> m;
    int x, y;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y;
        g[x].push_back({y,true});
        g[y].push_back({x,true});
        grad[x] ++;
        grad[y] ++;
    }
}

void euler(int nod)
{
    while(g[nod].size())
    {
        while(g[nod].size() && g[nod].back().second == false)
            g[nod].pop_back();

        if(g[nod].size() == 0)
            break;

        int next = g[nod].back().first;

        g[nod].pop_back();
        vector <pair<int,bool>>::iterator it = find_if(g[next].begin(), g[next].end(), [&](pair<int,bool> p){return p.second == true && p.first == nod;});

        it->second = false;

        euler(next);
    }
    cicle.push_back(nod);
}

void output()
{
    for(const auto& i: cicle)
        o << i << ' ';
}

int main()
{
    input();
    for(int i = 1; i <= n; ++i)
        if(grad[i] % 2 == 1)
        {
            o << -1 << '\n';
            return 0;
        }
    euler(1);
    output();
    return 0;
}