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

#約数列挙
def make_divisors(n,m):
    divisors = []
    for i in range(1, min(m,int(n**0.5)+1)):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    divisors.sort()
    return divisors

tmp=make_divisors(n**k,m)

l=len(tmp)
ans=0
for i in range(l):
    if tmp[i]<=m:
        ans+=1
    else:
        break
        
print(ans)