#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");

vector < int > G[100100];
int N, M, X[500500], Y[500500], x, y, sol[500500], dim;
bitset < 500500 > viz;

inline bool eulerian()
{
    for (int i=1; i<=N; ++i)
        if (G[i].size()%2==1) return 0;
    return 1;
}

inline void Euler(int nod)
{
    vector <int>::iterator it;
    for (it=G[nod].begin(); it!=G[nod].end(); ++it)
        if (!viz[*it])
        {
            viz[*it]=true;
            Euler(X[*it]+Y[*it]-nod);
        }
    sol[++sol[0]]=nod;
}

int main()
{
    f>>N>>M;
    for (int i=1; i<=M; ++i)
    {
        f>>x>>y; X[i]=x; Y[i]=y;
        G[x].push_back(i);
        G[y].push_back(i);
    }

    if (!eulerian()) { g<<-1<<'\n'; return 0; }
        else
        {
            Euler(1);
            for (int i=1; i<=sol[0]; ++i)
                g<<sol[i]<<' ';
        }

    return 0;
}