#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll inf=INF*INF;
const int mod=1e9+7;
const ll MAX=500010;
const double PI=acos(-1.0);




signed main(){
    ll n,m;cin>>n>>m;
    vector<ll>ans(n+1);
    rep(i,m+1){
        REP(j,i,m+1){
            REP(k,j,m+1){
                ll x=i*i+j*j+k*k+i*j+j*k+k*i;
                ll y=i+j+k;
                ll d=k;
                while(d<=m&&d*d+x+y*d<=n){
                    ll z=d*d+x+d*y;
                    if(i<j){
                        if(j<k){
                            if(k<d){
                                ans[z]+=24;
                            }else{
                                ans[z]+=12;
                            }
                        }else{
                            if(k<d){
                                ans[z]+=12;
                            }else{
                                ans[z]+=4;
                            }
                        }
                    }else{
                        if(j<k){
                            if(k<d){
                                ans[z]+=12;
                            }else{
                                ans[z]+=6;
                            }
                        }else{
                            if(k<d){
                                ans[z]+=4;
                            }else{
                                ans[z]+=1;
                            }
                        }
                    }
                    d++;
                }
            }
        }
    }
    rep(i,n+1){
        cout<<ans[i]<<endl;
    }
}