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(N, i):
    t = min(N, i-1)
    s = max(1, i-t)
    res = max(0, t-s+1)
    return res
    
ans = 0
for i in make_divisors(K):
    j = K // i
    
    ans += f(N, i) * f(N, j)

print(ans)