#include <bits/stdc++.h>
using namespace std;
ifstream in("ciclueuler.in");
ofstream out("ciclueuler.out");
queue<pair<int,int>> v[100002];
int a[100002],viz[500002],k;
void dfs(int nr)
{
    while(!v[nr].empty())
    {
        int nr1=v[nr].front().first,nr2=v[nr].front().second;
        v[nr].pop();
        if(!viz[nr2])
        {
            viz[nr2]=1;
            dfs(nr1);
        }
    }
    if(k--)
        out<<nr<<" ";
}
int main()	
{
    int n,m,i,nr1,nr2;
    in>>n>>m;k=m;
    while(m--)
    {
        in>>nr1>>nr2;
        v[nr1].push({nr2,m});
        v[nr2].push({nr1,m});
        a[nr1]++;a[nr2]++;
    }
    for(i=1;i<=n;i++)
        if(a[i]%2)
        {
            out<<-1;
            return 0;
        }
    dfs(1);
    return 0;
}