#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target ("avx2")

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }




int main() {
  int N, M;
  scanf("%d%d", &N, &M);
  N *= 2;
  int ans[320'010] = {};
  for (int a = 0; a <= M; ++a) {
    for (int b = 0; b <= a; ++b) {
      for (int c = 0; c <= b; ++c) {
        for (int d = 0; d <= c; ++d) {
          const int s = (a+b+c+d)*(a+b+c+d) + a*a + b*b + c*c + d*d;
          if (s > N) {
            break;
          }
          ans[s] += ((b > c) ? (a > b) ? (c > d) ? 24 : 12 : (c > d) ? 12 : 6
                             : (a > b) ? (c > d) ? 12 : 4 : (c > d) ? 4 : 1);
        }
      }
    }
  }
  for (int s = 0; s <= N; s += 2) {
    printf("%d\n", ans[s]);
  }
  return 0;
}