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):
    a = min(x-1, N)
    b = max(1, x-N)
    return max(0, a - b + 1)

ans = 0
for x in make_divisors(K):
    y = K // x
    ans += f(x) * f(y)

print(ans)