#yuki847
def prime_list(n,k):
 t=[]
 for i in range(2,int(n**0.5)+1):
  if n%i==0:
   cnt=0
   while n%i==0:
    cnt+=1
    n//=i
   t.append([i,cnt*k])
 if n>1:
  t.append([n,k])
 return t
 
def dfs(now,d):
 global res
 if p[d][1] and now*p[d][0]<=m:
  p[d][1]-=1
  res+=1
  dfs(now*p[d][0],d)
  p[d][1]+=1
 if d+1<len(p):
  dfs(now,d+1)

n,k,m=map(int,input().split())
if n==1:
 print(1)
 exit()
p=prime_list(n,k)
res=1
dfs(1,0)
print(res)