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

#define Nmax 100005

using namespace std;
vector<int> G[Nmax],sol;
bitset<Nmax> used;
stack<int> S;
int N,M,grad[Nmax];


void Read()
{
    scanf("%d%d",&N,&M);
    int a,b;
    for(int i = 1; i <= M; ++i){
        scanf("%d%d",&a,&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);
}

int check()
{
    DFS(1);
    for(int i = 1; i <= N; ++i)
    {
        if(!used[i])
            return 0;
        if(grad[i] % 2 == 1)
            return 0;
    }
    return 1;
}

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

void euler(int k)
{
    int v;
    S.push(k);
    do{
        while(G[k].size()){
            v = G[k].back();
            S.push(v);
            sterge(k,v);
            k = v;
        }
        k = S.top();
        sol.push_back(S.top());
        S.pop();
    }while(!S.empty());
    for(int i = 0; i < sol.size(); ++i)
        printf("%d ",sol[i]);

}

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

    Read();
    if(check())
        euler(1);
    else
        printf("-1\n");

    return 0;
}