def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == K:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

N, K = list(map(int, input().split()))
ans = make_divisors(N)
# print(ans)
if ans[-1] == N - K:
    print(len(ans))
else:
    print(len(ans)+ 1)