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

#define Nmax 100005

using namespace std;

vector<int> G[Nmax],ans;
stack<int> S;
bitset<Nmax> used;

int N,M,degree[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);
        ++degree[a];
        ++degree[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 v;
    do{
        while(G[k].size()){
            S.push(k);
            v = G[k][0];
            sterge(k,v);
            k = v;
        }
        k = S.top();
        S.pop();
        ans.push_back(k);
    }while(!S.empty());
}

void Check()
{
    int ok = 1;
    DFS(1);
    for(int i = 1;i <= N; ++i)
        if(!used[i] || degree[i] % 2 != 0)
            ok = 0;
    if(!ok){
        printf("-1\n");
        return;
    }
    euler(1);
    for(int i = ans.size() -1 ; i >= 0; --i)
        printf("%d ",ans[i]);
}

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

    Read();
    Check();

    return 0;
}