import math
n, k, m=map(int, input().split())
fac=[]
for i in range(2, n+1):
    if i*i>n:
        break
    if n%i==0:
        e=0
        while n%i==0:
            n//=i
            e+=1
        fac.append((i, e))
if n>1:
    fac.append((n, 1))
def dfs(i, dans):
    if i==len(fac):
        if dans[0]<=m:
            dans[1]+=1
        return
    pp=1
    for j in range(min(k*fac[i][1]+1, int(math.log(m, fac[i][0])))):
        dans[0]*=pp
        dfs(i+1, dans)
        dans[0]//=pp
        pp*=fac[i][0]
    return
dans=[1, 0]
dfs(0, dans)
print(dans[1])