def prime_factorization(n, K):  # 素因数分解
    res = []
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            cnt = 0
            while n % i == 0:
                cnt += 1
                n //= i
            res.append([i, cnt*K])
    if n > 1:
        res.append([n, K])
    return res


N, K, M = map(int, input().split())
if N == 1:
    print(1)
    exit()
pf = prime_factorization(N, K)
ans = 1


def dfs(now, d):
    global ans
    if pf[d][1] and now * pf[d][0] <= M:
        pf[d][1] -= 1
        ans += 1
        dfs(now * pf[d][0], d)
        pf[d][1] += 1
    if d + 1 < len(pf):
        dfs(now, d + 1)


dfs(1, 0)
print(ans)