import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)

def factorize(n):
    fct = []  # prime factor
    b, e = 2, 0  # base, exponent
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct

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

div = factorize(n)
div = [(div[i][0], div[i][1]*k) for i in range(len(div))]

ans = []
def dfs(i, now):
    if i == len(div):
        ans.append(now)
        return
    for j in range(div[i][1]+1):
        if now*div[i][0]**j <= m:
            dfs(i+1, now*div[i][0]**j)
        else:
            break

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