n,k,m = map(int,input().split())
import math
import sys
sys.setrecursionlimit(10**7)

def base10to(n, b):
    if (int(n/b)):
        return base10to(int(n/b), b) + str(n%b)
    return str(n%b)


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

fac = factorization(n)
#fac = fac[1:]
#print(fac)
ans = 0

def dfs(v,ttl):
    global ans
    if v == len(fac):
        ans += 1
        return
    for i in range(31):
        if fac[v][1]*k < i:
            break
        if fac[v][0] == 1 and i >= 1:
            break
        num = pow(fac[v][0],i)
        if ttl*num <= m:
            dfs(v+1,ttl*num)
        else:
            break
#if len(fac) > 0:
dfs(0,1)
print(ans)