from math import sqrt
import bisect
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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


L = [v**2 for v in range(1, N+1)]
LIM = N**2+D


def fact(n):
    if n == 3:
        return 6
    elif n == 2:
        return 3
    else:
        return 1


def solve2():
    left = [x+y for x in L for y in L]
    left = sorted(left)
    ans = 0
    for w in L:
        for z in L:
            tmp = w-z+D
            ind = bisect.bisect_left(left, tmp)
            if left[ind] == tmp:
                rt = sqrt(tmp/2)
                if rt == int(rt):
                    ans += 1
                else:
                    ans += 2
    print(ans)


def solve1():
    ans = 0
    for x in range(1, N+1):
        tmp1 = x**2
        if tmp1 > LIM:
            break
        for y in range(x, N+1):
            tmp2 = tmp1+y**2
            if tmp2 > LIM:
                break
            for z in range(y, N+1):
                tmp3 = tmp2 + z**2
                if tmp3 > LIM:
                    break
                r = tmp3-D
                if r <= 0:
                    continue
                else:
                    rt = sqrt(r)
                    if rt <= N and rt == int(rt):
                        ans += fact(len(set([x, y, z])))
    print(ans)


# solve1()
solve2()