import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N,K = I(),I()


def f(x):  # a+b == x (1 <= a,b <= N) の解の個数
    if x <= 1 or x >= 2*N+1:
        return 0
    if 2 <= x <= N+1:
        return x-1
    else:
        return 2*N+1-x


ans = 0
for d in range(1,int(K**.5)+1):
    if K % d == 0:
        if d == K//d:
            ans += f(d)**2
        else:
            ans += 2*f(d)*f(K//d)

print(ans)