#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
#define mp make_pair
#define x first
#define y second
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
vector <pair<int,int> > v[100005];
vector <int> sol;
int i,j,n,m,f[100005],muchii[500005],nr,idx[100005];
///stack <pair<int,int> > st;
void conex(int nod)
{
    if(f[nod])
        return;
    f[nod] = 1;
    for(int i = 0; i < v[nod].size(); i++)
        conex(v[nod][i].x);
    nr++;
}
void go(int nod)
{
    while(idx[nod] < v[nod].size())
    {
        pair<int,int> now = v[nod][ idx[nod] ];
        if(muchii[ now.y ] == 0)
        {
            muchii[ now.y ] = 1;
            idx[nod]++;
            go(now.x);
        }
        else
            idx[nod]++;
    }
    sol.push_back(nod);
}
int main()
{
    fin >> n >> m;
    for(i = 1; i <= m; i++)
    {
        int a,b;
        fin >> a >> b;
        v[a].push_back(mp(b,i));
        v[b].push_back(mp(a,i));
    }
    conex(1);
    if(nr != n)
    {
        fout<<-1;return 0;
    }
    for(i = 1; i <= n; i++)
        if(v[i].size() % 2)
        {
            fout<<-1;return 0;
        }
    go(1);
    for(i = 0; i < sol.size() - 1; i++)
        fout<<sol[i]<<" ";
    return 0;
}