import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      
      auto anss = new int[1 << 3][N + 1];
      foreach (a; 0 .. M + 1) {
        foreach (b; a .. M + 1) {
          if (a*a + 3*a*b + 6*b*b > N) {
            break;
          }
          foreach (c; b .. M + 1) {
            if (a*a + a*b + b*b + 2*a*c + 3*b*c + 2*c*c > N) {
              break;
            }
            foreach (d; c .. M + 1) {
              const s = a*a + a*b + b*b + a*c + b*c + c*c + a*d + b*d + c*d + d*d;
              if (s > N) {
                break;
              }
              int p;
              if (a < b) p |= 1 << 0;
              if (b < c) p |= 1 << 1;
              if (c < d) p |= 1 << 2;
              ++anss[s][p];
            }
          }
        }
      }
      foreach (s; 0 .. N + 1) {
        int ans;
        ans += anss[s][0] * 1;
        ans += anss[s][1] * 4;
        ans += anss[s][2] * 6;
        ans += anss[s][3] * 12;
        ans += anss[s][4] * 4;
        ans += anss[s][5] * 12;
        ans += anss[s][6] * 12;
        ans += anss[s][7] * 24;
        writeln(ans);
      }
      debug {
        writeln("====");
      }
    }
  } catch (EOFException e) {
  }
}