import math

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

max_sum_ab = 2 * n * n
cnt_ab = [0] * (max_sum_ab + 1)

for x in range(1, n + 1):
    x_sq = x * x
    for y in range(1, n + 1):
        sum_ab = x_sq + y * y
        if sum_ab <= max_sum_ab:
            cnt_ab[sum_ab] += 1

result = 0

for w in range(1, n + 1):
    s = w * w + D
    if s < 1:
        continue  # z must be at least 1, z^2 >=1 > s when s <1, no solution
    z_max = min(n, math.isqrt(s))
    for z in range(1, z_max + 1):
        z_sq = z * z
        target = s - z_sq
        if target < 0 or target > max_sum_ab:
            continue
        result += cnt_ab[target]

print(result)