#include <fstream>
#include <vector>

using namespace std;

int N, M;
int u[500005], v[500005];

vector <int> L[500005];
bool seen[500005];
int pos[500005];
int K;
int i, k;

int sol[500005];

inline void DFS (int node)
{
    while (pos[node] < L[node].size())
    {
        K = L[node][pos[node]];
        pos[node]++;
        if (!seen[K])
        {
            seen[K] = 1;
            DFS(u[K]+v[K]-node);
        }
    }
    sol[++k] = node;
}

int main ()
{
    ifstream fin ("ciclueuler.in");
    fin >> N >> M;
    for (i=1; i<=M; i++)
    {
        fin >> u[i] >> v[i];
        L[u[i]].push_back(i);
        L[v[i]].push_back(i);
    }
    ofstream fout("ciclueuler.out");
    for (i=1; i<=N; i++)
        if (L[i].size()%2 == 1)
        {
            fout << -1;
            return 0;
        }
    DFS(1);
    for (i=1; i<k; i++)
        fout << sol[i] << ' ';
    fout.close();
    return 0;
}