def g(a,b,c,d):
    return a*a+a*b+a*c+a*d+b*b+b*c+b*d+c*c+c*d+d*d


N,M=map(int,input().split())

X=[0]*(N+1)
for a in range(M+1):
    for b in range(M+1):
        for c in range(M+1):
            for d in range(M+1):
                K=g(a,b,c,d)
                if K>N:
                    break
                X[K]+=1

print(*X,sep="\n")