#include <bits/stdc++.h>
#include <atcoder/all>

typedef long long int ll;
typedef long double ld;

using namespace std;
using namespace atcoder;

#define inf 1010000000
#define llinf 1001000000000000000ll
#define pi 3.141592653589793238
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(ll i = 1; i <= (n); i++)
#define rep2(i,l,r) for(int i = (l); i < (r); i++)
#define per(i, n) for(ll i = (n)-1; i >= 0; i--)
#define each(x, v) for (auto&& x : v)
#define rng(a) a.begin(),a.end()
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define st string
#define sz(x) (int)(x).size()
#define mems(x) memset(x, -1, sizeof(x));
#define pcnt __builtin_popcountll
#define _GLIBCXX_DEBUG

#define dame { puts("-1"); return 0;}
#define yes { puts("Yes"); return 0;}
#define no { puts("No"); return 0;}
#define ret(x) { cout<<(x)<<endl;}
#define rets(x) { cout<<(x)<< " ";}
#define Endl cout<<endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false;}

// 仮マクロ 便利だったら昇格
#define dump(x) { cout << #x << " = " << (x) << endl;}
#define bit(n) (1LL<<(n))
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end())

template <class T = ll>
inline T in(){ T x; cin >> x; return (x);}

#define vcin(x,n) {for(ll loop=0; loop<(n); loop++) cin>>x[loop];}

// ここまで仮マクロ

// srand((unsigned)time(NULL)); rand()を用いる際にmainの頭に置く
// clock()/CLOCKS_PER_SEC 秒数を知りたいときに用いる

#define mod 998244353
using mint = modint998244353;

/*

#define mod 1000000007
using mint = modint1000000007;

*/

vector<ll> dx={1,0,-1,0};
vector<ll> dy={0,1,0,-1};

using pl = pair<ll,ll>;
using ppl = pair<ll,pl>;
using V = vector<ll>;
using Graph = vector<vector<ll>>;
// G.assign(n, vector<ll>()); グローバル変数にGを置く時に置く

// 関数を置くのはここ以下

int f(int i, int j, int k, int l){
  int cnt = 4;
  if(i==j) cnt--;
  if(j==k) cnt--;
  if(k==l) cnt--;
  if(cnt==4){
    return 24;
  }
  if(cnt==3){
    return 12;
  }
  if(cnt==2){
    if(j==k){
      return 4;
    }else{
      return 6;
    }
  }
  if(cnt==1){
    return 1;
  }
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  int n,m; cin >> n >> m;
  int tmp;
  rep(i,2*n){
    if(i*i>2*n){
      tmp = i;
      break;
    }
  }
  int ans[n+1]; rep(i,n+1) ans[i] = 0;
  rep(i,m+1){
    rep2(j,i,m+1){
      if(i+j==tmp) break;
      rep2(k,j,m+1){
        if(i+j+k==tmp) break;
        rep2(l,k,m+1){
          if(i+j+k+l==tmp) break;
          ll sum = i*i+j*j+k*k+l*l+(i+j+k+l)*(i+j+k+l);
          sum /= 2;
          if(sum<=n){
          	ans[sum] += f(i,j,k,l);
          }
        }
      }
    }
  }
  rep(i,n+1) ret(ans[i])
}