def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = n
    while i*i >= n:
        if n % i == K:
            lower_divisors.append(i)
            if i != n // i:
            	if n // i > K : 
            		upper_divisors.append(n//i)
        i -= 1
    return lower_divisors + upper_divisors[::-1]
N ,  K = map(int,input().split())
#print(make_divisors(N))
print(len(make_divisors(N)))