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 + c == xとなる(a, c)の組の数をreturn
    s = max(1, x-N)
    t = min(N, x-1)
    return max(0, t-s+1)

ans = 0
for s in make_divisors(K):
    t = K // s
    ans += f(s) * f(t)

print(ans)