#include <bits/stdc++.h>

using namespace std;

vector <pair <int, int>> graph[100005]; // prima valoare este nodul vecin, a doua valoare este ID ul muchiei
int grade[100005];
int visited[100005];
int visitedEdges[500005];
int currentEdge[100005];
vector <int> cycle;

void buildCycle(int node) {
    while (currentEdge[node] < graph[node].size()) { // cat timp inca am vecini de procesat in nodul actual
        pair <int, int> edge = graph[node][currentEdge[node]]; // imi iau vecinul {vecin, idMuchie}
        currentEdge[node] += 1; // cresc muchia curenta
        if (visitedEdges[edge.second]) continue; // daca muchia actuala a fost deja vizitata, NU fac nimic
        visitedEdges[edge.second] = 1; // altfel o vizitam
        buildCycle(edge.first); // continui DFS ul in vecinul respectiv
    }
    // cand nu mai am nimic de procesat in nodul asta
    cycle.push_back(node);
}

void dfs(int node) {
    visited[node] = 1;
    for (auto x : graph[node]) {
        if (!visited[x.first]) {
            dfs(x.first);
        }
    }
}

int main()
{
    freopen("ciclueuler.in", "r", stdin);
    freopen("ciclueuler.out", "w", stdout);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int x, y;
        cin >> x >> y;
        graph[x].push_back({y, i});
        graph[y].push_back({x, i});

        grade[x] += 1;
        grade[y] += 1;
    }
    dfs(1);

    for (int i = 1; i <= n; ++i) {
        if (!visited[i] or grade[i] % 2) {
            // NU exista solutie
            cout << -1;
            return 0;
        }
    }

    buildCycle(1);

    cycle.pop_back();

    for (auto x : cycle) {
        cout << x << " ";
    }
    return 0;
}