#include<bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int F(int a,int b,int c,int d){  int x=a*a; a+=b; x+=a*b; a+=c; x+=a*c; a+=d; x+=a*d; return x; }

int main(){
	int N,M; cin>>N>>M;
	ULL A[160000]={};
	rep(a,M){
		if(F(a,0,0,0)>N) break;
		A[F(a,a,a,a)]+=1;
		rep(b,a){
		  if(F(a,b,0,0)>N) break;
		  A[F(a,b,b,b)]+=4;
		  A[F(a,a,b,b)]+=6;
		  A[F(a,a,a,b)]+=4;
			rep(c,b){
				if(F(a,b,c,0)>N) break;
				A[F(a,b,c,c)]+=12;
				A[F(a,b,b,c)]+=12;
				A[F(a,a,b,c)]+=12;
				rep(d,c){
					int x=F(a,b,c,d);
					if(x<=N) A[N]+=24; else break;
				}
			}
		}
	}
	rep(i,N+1) cout<<A[i]<<endl;

	return 0;
}