#include <iostream>
#include <list>
#include <stack>
#include <vector>
#include<algorithm>

#define NMax 100001

using namespace std;

stack<int> s;
vector<int> v[NMax];
vector<int> cycle;
int n, m, x, y;

bool isEuler () {
    for (int i = 1; i <= n; i++)
        if (v[i].size () & 1)
            return 0;
    return 1;
}

void euler (int now) {
    int last;
    for (s.push (now); !s.empty ();) {
        now = s.top ();
        if (!v[now].empty ()) {
            int last = v[now].back ();

            v[now].pop_back ();
            v[last].erase ( find (v[last].begin (), v[last].end (), now) );

            s.push (last);
        }
        else {
            s.pop ();
            cycle.push_back (now);
        }
    }
}

int main()
{
    freopen( "ciclueuler.in", "rt", stdin);
    freopen( "ciclueuler.out", "wt", stdout);

    cin >> n >> m;
    for (int i = 1; i <= m; i++)
        cin >> x >> y,
        v[x].push_back (y),
        v[y].push_back (x);

    if (!isEuler ()) {
        cout << -1;
        return 0;
    }

    euler (1);
    for (int i = 0; i < cycle.size () - 1; i++)
        cout << cycle[i] << ' ';

    return 0;
}