def make_divisors(n):
    divisors = []
    i = 1
    while i * i <= n:
        if n % i == 0:
            divisors.append(i)
            j = n // i
            if i != j:
                divisors.append(j)
        i += 1
    return divisors

N = int(input())
K = int(input())

def f(x):
    if x-1 <= N:
        return max(0, x-1)
    else:
        return max(0, N- (x-N) + 1)

ans = 0
for i in make_divisors(K):
    j = K // i
    ans += f(i) * f(j)

print(ans)