def calc_divisors(N):
    res = []
    for i in range(1, N + 1):
        if i**2 > N:
            break
        if N % i != 0:
            continue

        res.append(i)

        if N // i != i:
            res.append(N // i)

    res.sort()
    return res


def main():
    N, K = map(int, input().split())

    divs = calc_divisors(N - K)
    cnt = 0
    for d in divs:
        if N % d == K:
            cnt += 1

    print(cnt)


main()