#include <cstdio>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;
const int Nmax = 100005;
int N,M;

vector<int> G[ Nmax ],answer;
stack <int> S;

inline void scan(int &A)
{
    char c = 0;
    A = 0;
    do
    {
        c=fgetc(stdin);
        if(c >='0' && c <='9')
            A = A * 10 + c - 48;
    }
    while(c >= '0' && c<= '9');
}

inline int eulerian(){
    for(int i = 1; i <= N; ++i)
        if(G[i].size() & 1)return 0;
    return 1;
}

inline void read()
{
    scan(N);scan(M);
    int a,b;
    for(int i=1;i<=M;++i)
    {
        scan(a),scan(b);
        G[a].push_back(b);
        G[b].push_back(a);
    }
}

inline void DFS(int nodc) // dfs iterativ
{
    S.push(nodc);
    int y;
    while(!S.empty())
    {
        nodc = S.top();
        if(!G[nodc].size()) // ne intoarcem in stiva
        {
            S.pop();
            answer.push_back(nodc);
        }
        else
        {
            y = G[nodc].back(); // mergem in dfs la ultimul vecin a lui nodc
            G[nodc].pop_back(); // stergem muchia catre el pt ca o folosim
            S.push(y);
            G[y].erase(find(G[y].begin(),G[y].end(),nodc)); // stergem muchia de la el la nodc
        }
    }
}


int main()
{
    freopen("ciclueuler.in","r",stdin);
    freopen("ciclueuler.out","w",stdout);

    read();
    if(eulerian())
    {
        DFS(1);
        for(int i = 0; i < answer.size() ;++i)
            printf("%d ",answer[i]);
    }
    else
        printf("-1");
    return 0;
}