#include <cstdio>
#include <vector>
#include <algorithm>
#include <stack>
#include <bitset>

#define Nmax 100005
#define DIM 1000005

using namespace std;
vector<int> G[Nmax],sol;
bitset<Nmax> used;
stack<int> S;
int N,M,grad[Nmax];
char buff[DIM];
int pz = DIM - 1;

int scan(int &A)
{
    A = 0;
    while('0' > buff[pz] || buff[pz] > '9')
        if(++pz == DIM) fread(buff,1,DIM,stdin),pz = 0;
    while('0' <= buff[pz] && buff[pz] <= '9')
    {
        A = A * 10 + buff[pz] - 48;
        if(++pz == DIM) fread(buff,1,DIM,stdin),pz = 0;
    }
}


void read()
{
    scan(N);scan(M);
    int a,b;
    for(int i = 1; i <= M; ++i)
    {
        scan(a);scan(b);
        G[a].push_back(b);
        G[b].push_back(a);
        grad[a]++;
        grad[b]++;
    }
}

void DFS(int k)
{
    used[ k ] = 1;
    for(vector<int> :: iterator it = G[k].begin(); it != G[k].end(); ++it)
        if(!used[ *it ])
                DFS(*it);
}

void sterge(int k,int v)
{
    G[k].erase(G[k].begin());
    G[v].erase(find(G[v].begin(),G[v].end(),k));
}

void euler(int k)
{
    int nou;
    do
    {
        while(G[k].size())
        {
            S.push(k);
            nou = G[k].front();
            sterge(k,nou);
            k = nou;
        }
        k = S.top(); S.pop();
        sol.push_back(k);
    }while(!S.empty());
}

void solve()
{
    for(int i = 1; i <= N; ++i)
        if(grad[i] % 2 == 1 || !used[i])
        {
            printf("-1\n");
            return;
        }
    /// deci se poate scoate ciclu'
    euler(1);
    for(int i = sol.size()-1; i >= 0; --i)
        printf("%d ",sol[i]);
}

int main()
{
    freopen("ciclueuler.in","r",stdin);
    freopen("ciclueuler.out","w",stdout);

    read();
    DFS(1);
    solve();

    return 0;
}