import math

def f(n, m):
    count = 0

    for a in range(0, m + 1):
        for b in range(0, m + 1):
            for c in range(0, m + 1):
                S = a + b + c
                C = a*a + b*b + c*c + a*b + a*c + b*c

                D = S*S - 4*(C - n)
                if D < 0:
                    continue

                sqrtD = int(math.isqrt(D))
                if sqrtD * sqrtD != D:
                    continue

                # possible roots
                d1 = (-S + sqrtD) // 2
                d2 = (-S - sqrtD) // 2

                if (-S + sqrtD) % 2 == 0 and 0 <= d1 <= m:
                    count += 1
                if d1 != d2 and (-S - sqrtD) % 2 == 0 and 0 <= d2 <= m:
                    count += 1

    return count

n,m = map(int,input().split())
for i in range(0, n + 1):
    print(f(i, m))