n,k = map(int, input().split())
def count_divisors(n, k):
  count = 0
  for a in range(1, n + 1):
    if (n % a) == k:
      count += 1
  return count
print(count_divisors(n,k))