import math

def get_factors(n):
    factors = []
    # Handle even numbers
    if n % 2 == 0:
        cnt = 0
        while n % 2 == 0:
            cnt += 1
            n = n // 2
        factors.append((2, cnt))
    # Check odd numbers up to sqrt(n)
    i = 3
    max_i = math.isqrt(n) + 1
    while i <= max_i and n > 1:
        if n % i == 0:
            cnt = 0
            while n % i == 0:
                cnt += 1
                n = n // i
            factors.append((i, cnt))
            max_i = math.isqrt(n) + 1
        else:
            i += 2
    if n > 1:
        factors.append((n, 1))
    return factors

def generate_divisors(factors):
    divisors = [1]
    for (p, exp) in factors:
        temp = []
        for d in divisors:
            current = d
            for _ in range(exp):
                current *= p
                temp.append(current)
        divisors += temp
    return divisors

n, m = map(int, input().split())
factors = get_factors(n)
divisors = generate_divisors(factors)
count = sum(1 for d in divisors if d > m)
print(count)