from math import gcd def isprime(n): if n <= 1: return False elif n == 2: return True elif n % 2 == 0: return False A = [2, 325, 9375, 28178, 450775, 9780504, 1795265022] s = 0 d = n - 1 while d % 2 == 0: s += 1 d >>= 1 for a in A: if a % n == 0: return True x = pow(a, d, n) if x != 1: for t in range(s): if x == n - 1: break x = x * x % n else: return False return True def pollard(n): if n % 2 == 0: return 2 if isprime(n): return n f = lambda x: (x * x + 1) % n step = 0 while 1: step += 1 x = step y = f(x) while 1: p = gcd(y - x + n, n) if p == 0 or p == n: break if p != 1: return p x = f(x) y = f(f(y)) def primefact(n): if n == 1: return [] p = pollard(n) if p == n: return [p] left = primefact(p) right = primefact(n // p) left += right return sorted(left) def primedict(n): P = primefact(n) ret = {} for p in P: ret[p] = ret.get(p, 0) + 1 return ret def divisor_lst(n): if n == 1: return [1] primes = primefact(n) primes.append(primes[-1] + 1) bef = primes[0] cnt = 0 ret = [1] for p in primes: if p == bef: cnt += 1 else: times = bef le = len(ret) for _ in range(cnt): for i in range(le): ret.append(ret[i] * times) times *= bef bef = p cnt = 1 ret.sort() return ret n, k = map(int, input().split()) n -= k divs = divisor_lst(n) print(sum(d > k for d in divs))