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): sita = max(1, x-N) ue = min(N, x-1) return max(0, ue - sita + 1) ans = 0 for a in make_divisors(K): b = K // a ans += f(a) * f(b) print(ans)