import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, M;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      
      auto dp = new int[][](N, N);
      dp[N - 1][] = -2;
      dp[N - 1][N - 1] = M;
      foreach_reverse (i; 0 .. N - 1) {
        Tuple!(int, int)[] ps;
        foreach (j; i + 1 .. N) {
          ps ~= tuple(dp[i + 1][j] + 1, j);
        }
        ps.sort!((a, b) => ([a[0], -a[1]] < [b[0], -b[1]]));
        const need = (N - i) / 2;
        debug {
          writeln("i = ", i);
          writeln("  ps = ", ps);
          writeln("  need = ", need);
        }
        int sum;
        foreach (k; 0 .. need) {
          sum += ps[k][0];
        }
        if (sum <= M) {
          dp[i][0 .. i] = -2;
          dp[i][i] = M - sum;
          dp[i][i + 1 .. $] = 0;
          foreach (k; 0 .. need) {
            dp[i][ps[k][1]] = ps[k][0];
          }
        } else {
          dp[i][] = dp[i + 1][];
          dp[i][i] = -1;
        }
      }
      debug {
        foreach_reverse (i; 0 .. N) {
          writeln(dp[i]);
        }
      }
      writeln(dp[0].to!string.replaceAll(regex(`[\[\],]`), ""));
    }
  } catch (EOFException e) {
  }
}