#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <limits.h>
#include <set>
#define nmax 100010
using namespace std;
int n,m,i,j,x,y,v,grad[nmax];
vector <int> g[nmax],sol;
stack <int> stiva;
int main(){
freopen("ciclueuler.in","r",stdin);
freopen("ciclueuler.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1;i<=m;i++){
    scanf("%d%d",&x,&y);
    grad[x]++; grad[y]++;
    g[x].push_back(y);
    g[y].push_back(x);
}
for (i=1;i<=n;i++)
if (grad[i]%2==1) { printf("-1"); return 0; }
stiva.push(1);
while (!stiva.empty()) {
    v=stiva.top();
    if (g[v].size()==0) stiva.pop(),sol.push_back(v); else
    {
        x=g[v][g[v].size()-1];
        stiva.push(x);
        g[v].pop_back();
        g[x].erase(find(g[x].begin(),g[x].end(),v));
    }
}
for (i=0;i<sol.size();i++)
    printf("%d ",sol[i]);
return 0;
}