n,k,m=map(int,input().split())
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])
    if arr==[]:
        arr.append([n, 1])
    return arr
l=factorization(n)
p=[]
for key,val in l:
    if key<=m:
        p.append([key,val*k])
kouho=[]
for key,val in p:
    tmp=[]
    for i in range(min(val+1,30)):
        if pow(key,i)<=m:
            tmp.append(pow(key,i))
    kouho.append(tmp)
ans=set()
if kouho==[]:
    print(1)
    exit()
def dfs(cnt,now):
    if cnt==len(kouho):
        ans.add(now)
        return
    for i in kouho[cnt]:
        if now*i>m:
            return
        dfs(cnt+1,now*i)
for i in kouho[0]:
    dfs(1,i)
print(len(ans))