n, k, m = map(int, input().split())

if n == 1:
    print(1)
    exit()

import math
def factorize(n):
    d = {}
    temp = int(math.sqrt(n))+1
    for i in range(2, temp):
        while n%i== 0:
            n //= i
            if i in d:
                d[i] += 1
            else:
                d[i] = 1
    if d == {}:
        d[n] = 1
    else:
        if n in d:
            d[n] += 1
        elif n != 1:
            d[n] =1
    return d

d = factorize(n)
for k_ in d.keys():
    d[k_] *= k

L = list(d.items())

ans = []

def dfs(x, cnt):
    if cnt == len(d):
        ans.append(x)
        return
    k, v = L[cnt]
    for i in range(0, v+1):
        x *= k**i
        if x > m:
            break
        dfs(x, cnt+1)
        x //= k**i

dfs(1, 0)
print(len(ans))