#include <fstream>
#include <vector>
#include <bitset>
#define edge g[nod][g[nod].size() - 1]
using namespace std;

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

int n, m;
bitset<500001> viz;
vector<int> answ;
vector<pair<int, int> > e;
vector<vector<int> > g;

void Read();
bool Check();
void Solve(int nod);

int main()
{
    Read();
    if ( !Check() )
        os << "-1";
    else
        Solve(1);
    is.close();
    os.close();
    return 0;
}

inline void Solve(int nod)
{
    while ( g[nod].size() )
        if ( viz[edge] )
            g[nod].pop_back();
        else
        {
            viz[edge] = true;
            Solve(e[edge].first + e[edge].second - nod);
        }
    if ( answ.size() )
    {
        os << answ[0] << " ";
        answ.pop_back();
    }
    answ.push_back(nod);
}

void Read()
{
    int n1, n2;
    is >> n >> m;
    g.resize(n + 1);
    e.push_back(make_pair(0, 0));
    for ( int i = 1; i <= m; ++i )
    {
        is >> n1 >> n2;
        g[n1].push_back(i);
        g[n2].push_back(i);
        e.push_back(make_pair(n1, n2));
    }
}

bool Check()
{
    for ( int i = 1; i <= n; ++i )
        if ( !g[i].size() || g[i].size() & 1 )
            return false;
    return true;
}