# Nを素因数分解、べき乗数をそれぞれK倍する
# そしてdfsでそれぞれの素因数をべき乗数までかけていくか

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

N, K, M = map(int, input().split())
factors = factorization(N)
L = len(factors)
for i in range(L):
    factors[i][1] *= K

import sys
sys.setrecursionlimit(10**7)

def dfs(l, product):
    global ans
    #print('l', l, 'product', product)
    if l == L:
        ans += 1
        return
    
    for j in range(0, factors[l][1]+1):
        new = product*pow(factors[l][0], j)
        if new <= M:
            dfs(l+1, new)
        else:
            # 枝刈り
            break

ans = 0
dfs(0, 1)
print(ans)