import bisect


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


n, k = map(int, input().split())
n -= k
A = make_divisors(n)
print(len(A[bisect.bisect_right(A, k) :]))