from collections import Counter
N, K, M = map(int, input().split())

prime_factors = []
for n in range(2, int(N ** 0.5) + 1):
    while N > 1:
        if N % n == 0:
            N //= n
            prime_factors.append(n)
        else:
            break
else:
    if N > 1:
        prime_factors.append(N)


C = Counter(prime_factors)
for c in C.keys():
    C[c] *= K
C = list(C.items())


def dfs(i, now):
    if i == len(C):
        return 1

    ans = 0
    for e in range(C[i][1] + 1):
        to_now = now * (C[i][0] ** e)
        if to_now > M:
            break
        ans += dfs(i + 1, to_now)
    return ans


print(dfs(0, 1))