#include <bits/stdc++.h>
#define N 100005
#define M 500005

using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");

int n, m, X[M], Y[M], viz[M], q[M], k, P[N];
vector <int> L[N];
void Citire()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        fin >> X[i] >> Y[i];
        L[X[i]].push_back(i);
        L[Y[i]].push_back(i);
    }
}

bool Eulerian()
{
    for(int i = 1; i <= n; i++)
        if(L[i].size() % 2 == 1)
            return 0;
    return 1;
}

void DFS(int nod)
{
    while(P[nod] < L[nod].size())
    {
        int i = L[nod][P[nod]++];

        if(!viz[i])
        {
            DFS(i);
            viz[i] = 1;
        }
    }
    q[++k] = nod;
}

void Rezolva()
{
    if(Eulerian() == 0)
        fout << "-1\n";
    else
    {
        DFS(X[1]);
        for(int i = 1; i <= k; i++)
            fout << q[i] << " ";
        fout << "\n";
    }
}
int main()
{
    Citire();
    Rezolva();
    return 0;
}