import sys
sys.setrecursionlimit(10**6)

def factors(n):
    f = []

    c = 0
    while n % 2 == 0:
        n //= 2
        c += 1
    if c > 0:
        f.append([2, c])

    p = 3
    while p * p <= n:
        c = 0
        while n % p == 0:
            n //= p
            c += 1
        if c > 0:
            f.append([p, c])
        p += 2
    if n != 1:
        f.append([n, 1])

    return f

N, K, M = map(int, input().split())

f = factors(N)
for x in f:
    x[1] = x[1] * K

def solve(fi, d):
    if fi >= len(f):
        return 1 if d <= M else 0

    res = 0    
    p = f[fi][0]
    for x in range(f[fi][1]+1):
        if d > M:
            break
        res += solve(fi+1, d)
        d*=p
    return res

ans = solve(0, 1)

print(ans)