def dfs(depth, cur):
    if depth == len(K_factors):
        return 1
        
    num, exp = K_factors[depth]
    
    for i in range(exp+1):
        if cur * num ** i > M:
            mark = i
            break
    else:
        mark = exp + 1

    return sum([dfs(depth+1, cur * num ** m) for m in range(mark)])
    
def factorize(n):
    factors = []
    
    for div in range(2, int(n ** 0.5) + 1):
        cnt = 0
        while n % div == 0:
            n //= div
            cnt += 1
        if cnt >= 1:
            factors.append((div, cnt))
            
    if n > 1:
        factors.append((n, 1))
        
    return factors

N, K, M = map(int, input().split())
factors = factorize(N)
K_factors = []

for factor, cnt in factors:
    K_factors.append((factor, cnt * K))

print(dfs(0, 1))