#include <fstream>
#include <vector>
#define MMAX 500002
#define NMAX 100002
using namespace std;
ifstream fin ("ciclueuler.in");
ofstream fout ("ciclueuler.out");
int n, m;
struct muchie {int x, y;
               bool uz;
              };
muchie LM[MMAX]; //lista muchiilor
int S[MMAX]; //stiva de varfuri
int vf;
vector<int>sol;
vector<int>LA[NMAX]; //listele de adiacenta

void citire();
bool grade_pare();
void determinare_euler();
void afisare();

int main()
{
    citire();
    if (grade_pare())
        fout << -1<<'\n';
        else
        {determinare_euler();
         afisare();}
 fout.close();
}

void citire()
{int i, x, y;
 fin >> n >> m;
 for (i=1; i<=m; i++)
      {
       fin >> x >> y;
       LA[x].push_back(i);
       LA[y].push_back(i);
       LM[i].x=x; LM[i].y=y; LM[i].uz=0;
      }
}
bool grade_pare()
{/// gconex , grad par
 /// verificam doar daca gradele nodurilor sunt pare
 int i;
 for (i = 1; i<=n; i++)
     if (LA[i].size()%2)
       return 1;
return 0;
}

void determinare_euler()
{int urm, crt;
 S[1]=1; vf=1;
 while (vf>0)
       { crt = S[vf];
        if (LA[crt].size()==0)
            { sol.push_back(crt);  vf--;  }
            else
            {
            urm= LA[crt].back();
            LA[crt].pop_back();
            if (LM[urm].uz == 0)
                {LM[urm].uz = 1;
                 if (crt == LM[urm].x)
                     S[++vf]=LM[urm].y;
                     else
                     S[++vf]=LM[urm].x;
                }
         }
    }
}
void afisare()
{int i;
 for (i = 0; i<sol.size()-1; i++)
     fout<< sol[i]<< " ";
fout<<'\n';
}