def prime_factors(n):
    factors = {}
    while n % 2 == 0:
        factors[2] = factors.get(2, 0) + 1
        n = n // 2
    i = 3
    while i * i <= n:
        while n % i == 0:
            factors[i] = factors.get(i, 0) + 1
            n = n // i
        i += 2
    if n > 1:
        factors[n] = 1
    return factors

def generate_divisors(factors):
    divisors = [1]
    for p, exp in factors.items():
        temp = []
        for e in range(exp + 1):
            pe = p ** e
            for d in divisors:
                temp.append(d * pe)
        divisors = temp
    return divisors

def main():
    import sys
    N, K = map(int, sys.stdin.readline().split())
    if K == 0:
        factors = prime_factors(N)
        count = 1
        for e in factors.values():
            count *= (e + 1)
        print(count)
    else:
        D = N - K
        factors = prime_factors(D)
        divisors = generate_divisors(factors)
        ans = 0
        for a in divisors:
            if a > K:
                ans += 1
        print(ans)

if __name__ == "__main__":
    main()