#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

ifstream is("ciclueuler.in");
ofstream os("ciclueuler.out");

vector<vector<int> > G;
vector<int> Cycle;
vector<pair<int, int> > E;
bitset<100001> v;
int n, m;

void Read();
bool Eulerian();
void Df(int node);

int main()
{
    Read();
    if ( Eulerian() )
    {
        Df(1);
        for ( vector<int>::iterator it = Cycle.begin(); it != Cycle.end() - 1; ++it )
            os << *it << ' ';
    }
    else
        os << -1;

    is.close();
    os.close();
    return 0;
}

void Read()
{
    is >> n >> m;
    int x, y;
    G = vector<vector<int> >(n + 1);
    E = vector<pair<int, int> >(m + 1);
    for ( int i = 1; i <= m; ++i )
    {
        is >> x >> y;
        G[x].push_back(i);
        G[y].push_back(i);
        E[i] = pair<int, int>(x, y);
    }
}

bool Eulerian()
{
    for ( const auto& g : G )
        if ( g.size() & 1 )
            return false;
    return true;
}

void Df(int node)
{
    for ( const int& g : G[node] )
        if ( !v[g] )
        {
            v[g] = 1;
            Df(E[g].first + E[g].second - node);
        }
    Cycle.push_back(node);
}