#include <fstream>
#include <stdio.h>
#include <vector>
#include <bitset>
#define Nmax 100099
#define Mmax 500099
#define x first
#define y second
using namespace std;
ifstream f("ciclueuler.in");

int n,m,sol[Mmax];
//bool viz[Mmax];
bitset < Mmax > viz(0);
vector <int> Graph[Nmax];
vector <pair <int,int> >Much;

inline void ReadInput()
{
    f>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        f>>x>>y;//citesc capetele muchiei i
        Much.push_back(make_pair(x,y));
        //pentru un nod x , Graph[x] reprezinta lista indicilor muchiilor incidente cu x
        Graph[x].push_back(i);
        Graph[y].push_back(i);
    }
    f.close();
}

inline bool EsteEulerian()
{
    //daca gradul nodului i este impar,atunci graful nu este eulerian
    for(int i=1;i<=n;i++)
        if(Graph[i].size() % 2==1) return false;
    return true;
}

inline void Euler(int nod)
{
     //parcurg lista muchiilor incidente cu nod

    vector <int>::iterator it;
    for(it=Graph[nod].begin();it!=Graph[nod].end();it++)
        if(!viz[*it]) //daca muchia mai exista
        {
            viz[*it]=true; //o sterg
            //vizitez celalalt capat al muchiei
            Euler(Much[*it].x+Much[*it].y-nod);
        }
        //dupa ce nodul nod a ramas cu gradul 0,este pus in ciclu
    sol[++sol[0]]=nod;
}

int main()
{
    freopen ("ciclueuler.out","w",stdout);
    ReadInput();
    //verific daca graful poate fi eulerian
    if(!EsteEulerian())
    {
        //nu este graf eulerian
        printf("-1\n");
    }
    else
    {
        Euler(1); //determin ciclul eulerian
        //afisez ciclul eulerian gasit
        for(int i=1;i<=sol[0];i++)printf("%d ",sol[i]);
        printf("\n");
    }
    return 0;
}