n, k = map(int, input().split())
val = n - k

def divisor_cnt(val):
	res = set()
	i = 1
	while(i**2 <= val):
		if val % i == 0:
			res.add(i)
			res.add(val // i)
		i += 1
	return len(res)

ans = divisor_cnt(val)
if k != 0: ans -= 1
print(ans)