#include <bits/stdc++.h>

using namespace std;

struct edge
{
    int x,y;
}muc[500010];
vector<int> g[100010],q;
char vaz[100010],elim[500010];

void dfs(int nod)
{
    vaz[nod]=1;
    for(vector<int>::iterator it=g[nod].begin();it!=g[nod].end();it++)
    {
        int vec=muc[*it].x^muc[*it].y^nod;
        if(!vaz[vec]) dfs(vec);
    }
}

void euler(int nod)
{
    while(g[nod].size())
    {
        int ind=g[nod].back();
        g[nod].pop_back();
        if(elim[ind]) continue;
        elim[ind]=1;
        q.push_back(nod);
        nod^=muc[ind].x^muc[ind].y;
    }
}

int main()
{
    freopen("ciclueuler.in", "r" ,stdin);
    freopen("ciclueuler.out", "w", stdout);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&muc[i].x,&muc[i].y);
        g[muc[i].x].push_back(i);
        g[muc[i].y].push_back(i);
    }
    dfs(1);
    for(int i=1;i<=n;i++)
        if(!vaz[i] || g[i].size()&1)
        {
            printf("-1");
            return 0;
        }
    int nod=1;
    while(1)
    {
        euler(nod);
        if(q.empty()) break;
        nod=q.back();
        q.pop_back();
        printf("%d ",nod);
    }
    return 0;
}