#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");

int N, M, X[500005], Y[500005], x, y;
vector < int > G[100005], sol;
bitset < 500005 > viz;

bool ok()
{
    for (int i=1; i<=N; ++i)
        if (G[i].size()%2) return 0;
    return 1;
}

inline void dfs(int nod)
{
    vector<int>::iterator it=G[nod].begin();
    for (; it!=G[nod].end(); ++it)
        if (!viz[*it])
            viz[*it]=1, dfs(X[*it]+Y[*it]-nod);
    sol.push_back(nod);
}

int main()
{
    f>>N>>M;
    for (int i=1; i<=M; ++i)
    {
        f>>x>>y; X[i]=x; Y[i]=y;
        G[x].push_back(i);
        G[y].push_back(i);
    }

    if (!ok()) { g<<-1<<'\n'; return 0; }

    dfs(1);
    for (int i=0; i<(int)sol.size(); ++i)
        g<<sol[i]<<' ';
    return 0;
}