#include <bits/stdc++.h>
#define NMAX 100002
FILE *fin  = freopen("ciclueuler.in", "r", stdin);
FILE *fout = freopen("ciclueuler.out", "w", stdout);

using namespace std;
int N, M;
vector <int> G[NMAX];
stack <int> S;
char buff[1 << 23];
int bufferIndex;

int readInt() {
    int ans = 0;
    while (buff[bufferIndex] < '0' || buff[bufferIndex] > '9') bufferIndex ++;
    while ('0' <= buff[bufferIndex] && buff[bufferIndex] <= '9')
        ans = ans * 10 + buff[bufferIndex ++] - '0';
    return ans;
}

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

void euler(int node)
{
    while(G[node].size())
    {
        S.push(node);
        int son = G[node].back();
        G[node].pop_back();
        for(int i = 0; i < G[son].size(); ++ i)
        if(G[son][i] == node){
            G[son].erase(G[son].begin() + i);
            break;
        }
        node = son;
    }
}
void solve()
{
    bool dfs = true;

    for(int i = 1; i <= N; ++ i)
        if((int)G[i].size() & 1){
            printf("-1\n");
            return;
        }

    for(int node = 1; !S.empty() || dfs; dfs = 0, printf("%d ", node)){
        euler(node);
        node = S.top();
        S.pop();
    }

}
int main()
{
    fread(buff, 1, 1 << 23, stdin);
    read();
    solve();
    return 0;
}