# 約数列挙
def make_divisors(n):
    lower_divisors = []
    upper_divisors = []
    for i in range(1, int(n ** .5) + 1):
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n // i)

    upper_divisors.reverse()
    return lower_divisors + upper_divisors


n = int(input())
k = int(input())

li = make_divisors(k)

ans = 0
for m in li:
    p = k // m
    ans += min(m - 1, max(2 * n - m + 1, 0)) * \
        min(p - 1, max(2 * n - p + 1, 0))

print(ans)