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

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;

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[x].size() > 0 ) {
                int y = g[x].back();
                g[x].pop_back();
                int j = g[y].size()-1;
                while ( g[y][j] != x ) {
                    -- j;
                }
                g[y][j] = g[y].back();
                g[y].pop_back();
                x = y;
                s.push(x);
            }
            fout << x << " ";
            s.pop();
        }
    } else {
        fout << "-1\n";
    }

    return 0;
}