# include <iostream>
# include <fstream>
# include <vector>
# include <bitset>
# include <stack>
using namespace std;

# define MAXN 100010
# define MAXM 500010
typedef vector< pair<int, int> >::iterator iter;

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

int n, m;
vector< pair<int, int> > G[MAXN];
bitset<MAXM> vizmuchie;
vector<int> sol;
int grd[MAXN];
stack<int> stiva;

bool iseuler() {
    for (int i = 1; i <= n; i++) {
        if (grd[n] & 1 == 1) {
            return false;
        }
    }
    return true;
}

/*void euler(int nod) {
    for (int i = 0; i < G[nod].size(); i++) {
        if (vizmuchie[G[nod][i].second] == false) {
            vizmuchie[G[nod][i].second] = true;
            euler(G[nod][i].first);
        }
    }
    sol.push_back(nod);
}*/

void euler() {
    stiva.push(1);
    while (stiva.empty() == false) {
        int nd = stiva.top();

        bool ok = false;
        for (int i = 0; i < G[nd].size(); i++) {
            //cout << "verific mudhie " << G[nd][i].second << endl;
            if (vizmuchie[G[nd][i].second] == false) {
                vizmuchie[G[nd][i].second] = true;
                //cout << nd << " intru in " << G[nd][i].first << endl;
                stiva.push(G[nd][i].first);
                ok = true;
                break;
            }
        }
        if (ok == true) {
            continue;
        }
        sol.push_back(nd);
        stiva.pop();
    }
}

int main()
{
    f >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y;
        f >> x >> y;

        G[x].push_back(make_pair(y, i));
        G[y].push_back(make_pair(x, i));

        grd[x] ++;
        grd[y] ++;
    }

    if (iseuler() == true) {
        euler();
        sol.pop_back();

        for (int i = 0; i < sol.size(); i++) {
            g << sol[i] << ' ';
        }
    } else {
        g << '-1';
    }

    return 0;
}