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):
                for d in range(0, m + 1):
                    if (a * (a + b + c + d)
                        + b * (b + c + d)
                        + c * (c + d)
                        + d * d) == n:
                        count += 1
    return count


n,m = map(int,input().split())

for i in range(0, n + 1):
    print(f(i, m))