#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>

using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

ll ans[161616];

ll f(ll a, ll b, ll c, ll d){
	return ((a*a+b*b+c*c+d*d+(a+b+c+d)*(a+b+c+d))/2);
}

ll calc(ll a, ll b, ll c, ll d){
	ll ret = 24ll;
	if(a==b){
		ret /= 2;
		if(b==c){
			ret /= 3;
			if(c==d){
				ret /= 4;
			}
		}else if(c==d){
			ret /= 2;
		}
	}else if(b==c){
		ret /= 2;
		if(c==d){
			ret /= 3;
		}
	}else if(c==d){
		ret /= 2;
	}
	return ret;
}

int main(void){
	ll n,m,a,b,c,d,i;
	std::cin >> n >> m;
	for(a=0; a<=m; ++a){
		if(f(a,a,a,a)>n){
			break;
		}
		for(b=a; b<=m; ++b){
			if(f(a,b,b,b)>n){
				break;
			}
			for(c=b; c<=m; ++c){
				if(f(a,b,c,c)>n){
					break;
				}
				for(d=c; d<=m; ++d){
					if(f(a,b,c,d)>n){
						break;
					}
					ans[f(a,b,c,d)] += calc(a,b,c,d);
				}
			}
		}
	}
	for(i=0; i<=n; ++i){
		std::cout << ans[i] << std::endl;
	}
	return 0;
}