N,K,M=map(int, input().split())
if N==1:
  print(1)
  exit()
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
A=factorization(N)
a=len(A)
D=[]
for a,b in A:
  D.append((a,b*K))
from collections import deque
d=deque()
d.append(1)
nd=deque()
ans=0
for i in range(2):
  while len(d):
    p=d.popleft()
    s,t=D[i]
    n=0
    while p*pow(s,n)<=M and n<=t:
      nd.append(p*pow(s,n))
      n+=1
  d=nd
  nd=deque()
print(len(d))