#include <fstream>
#include <vector>
#include <stack>
#include <unordered_set>

using namespace std;

ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");

const int nmax = 100000;
const int mmax = 500000;

vector <int> g[nmax+1];
bool u[nmax+1];

void dfs( int x ) {
    u[x] = 1;
    for ( int i = 0; i < int(g[x].size()); ++i ) {
        int xn = g[x][i];
        if ( u[xn] == 0 ) {
            dfs(xn);
        }
    }
}

stack <int> s;

typedef long long int64;

int64 mp( int x, int y ) {
    int64 sol;
    sol = int64(x)*(nmax+1)+y;
    return sol;
}

unordered_multiset <int64> us;

bool g_empty( int x ) {
    while ( g[x].size() > 0 && us.find(mp(x, g[x][g[x].size()-1])) != us.end() ) {
        us.erase(us.find(mp(x, g[x][g[x].size()-1])));
        g[x].pop_back();
    }
    return g[x].empty();
}

int main( ) {
    int n, m;
    fin >> n >> m;
    for ( int i = 1; i <= m; ++ i ) {
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }

    int ok = 1;
    dfs(1);
    for ( int i = 1; i <= n; ++ i ) {
        if ( g[i].size()%2 == 1 || u[i] == 0 ) {
            ok = 0;
        }
    }

    if ( ok == 1 ) {
        s.push(1);
        for ( int i = 1; i <= m; ++ i ) {
            int x = s.top();
            while ( g_empty(x) == 0 ) {
                int y = g[x][g[x].size()-1];
                g[x].pop_back();
                us.insert(mp(y, x));
                x = y;
                s.push(x);
            }
            fout << x << " ";
            s.pop();
        }
    } else {
        fout << "-1\n";
    }

    return 0;
}