import collections

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
        
    if n == 1:
        a.append(n)
        
    return a

n, k, m = map(int,input().split())

prime_clc = collections.Counter(prime_factorize(n))

for key in prime_clc:
    prime_clc[key] *= k
    
l_list = list(prime_clc.keys())
len_l_list = len(l_list)
ans_list = []

def dfs(dim1, now):
    if dim1 == len_l_list:
        return 
    
    for i in range(prime_clc[l_list[dim1]] + 1):
        if now * (l_list[dim1] ** i) <= m:
            ans_list.append(now * (l_list[dim1] ** i))
            dfs(dim1 + 1, now * (l_list[dim1] ** i))
        else:
            break
            
dfs(0, 1)

res = len(set(ans_list))
print(res)