N, D = map(int, input().split())
x2y2 = [0] * int(1e7 + 10)
for i in range(1, N + 1):
    for j in range(1, N + 1):
        x2y2[i * i + j * j] += 1
w2z2D = [0] * int(1e7 + 10)
for i in range(1, N + 1):
    for j in range(1, N + 1):
        d = i * i - j * j + D
        if d >= 2:
            w2z2D[d] += 1
ans = 0
for i in range(2, N * N * 2 + 1):
    if x2y2[i] and w2z2D[i]:
        ans += x2y2[i] * w2z2D[i]
print(ans)