void main(){
  import std.stdio, std.string, std.conv, std.algorithm;
  import std.typecons;

  int n, m; rd(n, m);

  auto as=[m];
  alias T=Tuple!(size_t, "i", int, "y");
  foreach(_; 0..(n-1)){
    T[] bs;
    foreach(i, a; as)  bs~=T(i, a+1);
    sort!((l, r)=>(l.y==r.y ? l.i>r.i : l.y<r.y))(bs);
    auto k=(bs.length+1)/2;
    auto nex=new int[](as.length);
    foreach(b; bs[0..k]) nex[b.i]=b.y;
    auto s=sum(nex);
    if(s<=m) as=(m-s)~nex;
    else as=(-1)~as;
  }

  writefln("%(%s %)", as);
}

void rd(T...)(ref T x){
  import std.stdio, std.string, std.conv;
  auto l=readln.split;
  assert(l.length==x.length);
  foreach(i, ref e; x){
    e=l[i].to!(typeof(e));
  }
}
void wr(T...)(T x){
  import std.stdio;
  foreach(e; x) write(e, " ");
  writeln();
}