import sys
import logging
import math
input = sys.stdin.readline
logger = logging.getLogger(__name__)


def read():
    N, K = map(int, input().strip().split())
    return N, K


def prime_factorization(n: int):
    if n == 1:
        return ([1], [1])
    factors = []
    counts = []
    for i in range(2, math.isqrt(n)+1):
        if i * i > n:
            break
        if n % i == 0:
            factors.append(i)
            n //= i
            count = 1
            while n % i == 0:
                n //= i
                count += 1
            counts.append(count)
    if n > 1:
        factors.append(n)
        counts.append(1)
    return factors, counts


def solve(N, K):
    n = N - K
    factors, counts = prime_factorization(n)
    n_factors = len(factors)
    ans = []

    def dfs(i, a):
        if i >= n_factors:
            if a > K:
                ans.append(a)
            return
        for count in range(counts[i]+1):
            dfs(i+1, a * (factors[i] ** count))
    
    dfs(0, 1)
    return len(ans)
    

if __name__ == "__main__":
    inputs = read()
    outputs = solve(*inputs)
    if outputs is not None:
        print("%s" % str(outputs))