#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#define NMAX 100005

using namespace std;

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

int i, n, m, x, y, gr[NMAX];
vector < int > v[NMAX], ans;
queue < int > q;
bool visited[NMAX];

void euler(int node)
{
    q.push(node);

    while (!q.empty())
    {
        int curr = q.front();

        if (v[curr].size())
        {
            int next = v[curr].back();
            v[curr].pop_back();
            q.push(next);
            v[next].erase(find(v[next].begin(), v[next].end(), curr));
        }
        else
        {
            q.pop();
            ans.push_back(curr);
        }
    }
}

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

    for (i = 1; i <= m; ++ i)
    {
        f >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
        gr[x] ++;
        gr[y] ++;
    }

    for (i = 1; i <= n; ++ i)
        if (gr[i] % 2 == 1 && gr[i] == 0)
    {
        g << -1;
        return 0;
    }

    euler(1);

    for (i = 0; i < ans.size() - 1; ++ i)
        g << ans[i] << " ";
    return 0;
}