#include <bits/stdc++.h>
#define LIM 1<<17
/// TONI BO$$ was here
/// #MLC

using namespace std;
char BUF[LIM];
int poz;

inline char getChar(){
    poz++;
    if(poz>=LIM){
    	fread(BUF,LIM,1,stdin);
    	poz=0;
    }
    return BUF[poz];
}

inline int getNr(){
    int r=0, semn=1;
    char ch=getChar();
    while(isdigit(ch)==0 && ch!='-') ch=getChar();
    if(ch=='-'){
        semn=-1;
        ch=getChar();
    }
    while(isdigit(ch)!=0){
        r=r*10+semn*(ch-'0');
        ch=getChar();
    }
    return r;
}

list <int> G[100001];
stack < int , vector <int> > steve;
stack < int , vector <int> > rez;
list <int> :: iterator it;
list <int> :: iterator it2;

int gr[100001];

int main()
{
    int n,m,i,x,y;
    freopen("ciclueuler.in","r",stdin);
    freopen("ciclueuler.out","w",stdout);
    poz=LIM;
    n=getNr();
    m=getNr();
    for(i=1; i<=m; i++)
    {
        x=getNr();
        y=getNr();
        gr[x]++;
        gr[y]++;
        G[x].emplace_back(y);
        G[y].emplace_back(x);
    }
    for(i=1; i<=n; i++)
        G[i].sort();
    for(i=1; i<=n; i++)
        if(gr[i]%2)
        {
            printf("-1");
            return 0;
        }
    steve.push(1);
    while(!steve.empty())
    {
        int z=steve.top();
        if(!gr[z])
        {
            steve.pop();
            rez.push(z);
            continue ;
        }
        it=G[z].begin();
        steve.push(*it);
        gr[*it]--;
        gr[z]--;
        if(*it!=z)
        {
            for(it2=G[*it].begin(); *it2!=z; it2++);
            G[*it].erase(it2);
            G[z].erase(it);
        }
        else
        {
            G[z].erase(it);
            it=G[z].begin();
            G[z].erase(it);
        }
    }
    rez.pop();
    while(!rez.empty())
    {
        printf("%d ",rez.top());
        rez.pop();
    }

    return 0;
}