def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors


def f(n, k):
    k -= 1
    if (k + 1) // 2 > n:
        return 0
    if n < k:
        return k - 2 * (k - n)
    else:
        return k


n = int(input())
k = int(input())
d = make_divisors(k)
ans = 0
for dv in d:
    v = k // dv
    ans += f(n, dv) * f(n, v)
print(ans)