#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int ans[1600001] = {};

int main() {
  int n, m; cin >> n >> m;
  for (int i = 0; i <= m; ++i) {
    int w = i * i;
    for (int j = i; j <= m; ++j) {
      int p = i + j, x = w + j * p;
      if (x > n) break;
      for (int k = j; j <= m; ++k) {
        int q = p + k, y = x + k * q;
        if (y > n) break;
        for (int l = k; l <= m; ++l) {
          int z = y + l * (q + l);
          if (z <= n) {
            if (i == l) {
              ans[z] += 1;
            } else if (i == k || j == l) {
              ans[z] += 4;
            } else if (i == j && k == l) {
              ans[z] += 6;
            } else if (i == j || j == k || k == l) {
              ans[z] += 12;
            } else {
              ans[z] += 24;
            }
          }
        }
      }
    }
  }
  for (int i = 0; i <= n; ++i) cout << ans[i] << '\n';
  return 0;
}