#include <iostream>
#include <fstream>
#include <vector>

#define pb push_back

using namespace std;

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

const int NLIM = 1e5+10;
const int MLIM = 5e5+10;

struct cucc
{
    int x, idx;
};

int n, m;
vector < cucc > graf[NLIM];
bool b[MLIM];

vector < int > er;
int nr;


bool eul()
{
    for(int i = 1; i <= n; ++i)
        if(graf[i].size() % 2 || graf[i].size() == 0)
            return false;
    return true;
}

bool dfs(int cnod)
{
    if(er.size() == m+1)
    {
        if(er.front() == er.back())
            return true;
        return false;
    }

    for(int i = 0; i < graf[cnod].size(); ++i)
    {
        if(!b[graf[cnod][i].idx])
        {
            b[graf[cnod][i].idx] = true;
            er.pb(graf[cnod][i].x);

            if(dfs(graf[cnod][i].x))
            {
                return true;
            }

            b[graf[cnod][i].idx] = false;
            er.pop_back();
        }
    }

}

int main()
{
    fin >> n >> m;

    cucc x, y;
    for(int i = 1; i <= m; ++i)
    {
        fin >> x.x >> y.x;
        x.idx = y.idx = i;

        graf[x.x].pb(y);
        graf[y.x].pb(x);
    }

    if(eul())
    {
        nr = 1;
        er.pb(1);
        bool wtf = dfs(1);

        for(int i = 0; i < m; ++i)
        {
            fout << er[i] << " ";
        }
    }
    else
    {
        fout << -1;
    }

    return 0;
}