program ciclueuler;

type pnod=^nod;
     nod=record inf,nro:longint; urm:pnod; end;
     muchie=record ns,nd,cate:longint; end;

var fi,fo:Text;
    //bufin,bufout:array[1..1 shl 17]of char;
    m,n,ind,i,nrm,unde,eulerian:longint;
    l:array[1..500100]of pnod;
    trecut,viz:array[1..500000]of 0..1;
    sol:array[1..500000]of longint;
    muchii:array[1..500000]of muchie;

    procedure push_back(nod,vecin,muchie:longint);
    var p:pnod;
    begin
        new(p); p^.inf:=vecin; p^.nro:=muchie; p^.urm:=l[nod]; l[nod]:=p;
        inc(sol[nod]); inc(sol[vecin]);
    end;

  procedure citire;
  var i,x,y:longint;
  begin
      readln(fi,n,m);
      for i:=1 to m do
        begin
            readln(fi,x,y);
            push_back(x,y,i);
            push_back(y,x,i);
        end;
  end;

  procedure euler(nod:longint);
  var p:pnod;
  begin
      trecut[nod]:=1;
      p:=l[nod];
      while p<>nil do
        begin
            if viz[p^.nro]=0 then
              begin
                  viz[p^.nro]:=1;
                  euler(p^.inf);
              end;
            p:=p^.urm;
        end;
      inc(ind);
      sol[ind]:=nod;
  end;

begin
    assign(fi,'ciclueuler.in'); reset(fi); //settextbuf(fi,bufin);
    assign(fo,'ciclueuler.out'); rewrite(fo); //settextbuf(fo,bufout);

      citire;

      eulerian:=1;

      //verific daca e eulerian
      for i:=1 to n do
        if sol[i] mod 2=1 then
          begin
              eulerian:=0;
              break;
          end;
      if eulerian=1 then
        begin

          for i:=1 to n do
            if trecut[i]=0 then
              euler(i);
        end
      else
        writeln(fo,-1);

      for i:=1 to ind-1 do
        write(fo,sol[i],' ');

      writeln(fo);
    close(fi); close(fo);
end.