import copy

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]
N,K,M= map(int,input().split())
D = make_divisors(N)
DD =[]
for d in D:
    if d<=M:
        DD.append(d)
CD = DD.copy()
temp = len(DD)
i=1
while i < K:
    for j in range(temp):
        for cd in CD:
            if DD[j]*cd<=M:
                DD.append(DD[j]*cd)
    i+=1
    DD = list(set(DD))
    if len(DD)==temp:
        break
    temp = len(DD)
print(len(DD))