def solve():
    n = int(input())
    k = int(input())
    def f(i):
        if i > n:
            return max(n - (i - n - 1), 0)
        return i - 1
    ans = 0
    for i in range(2, int(k ** .5) + 1):
        if k % i == 0:
            ans += f(i) * f(k // i) * 2
    return ans
print(solve())