MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from collections import deque
from heapq import heapify,heappush,heappop

def sieve(n):
    prime = []
    limit = n ** 0.5
    data = [i + 1 for i in range(1,n)]
    while True:
        p = data[0]
        if limit <= p:
            return prime + data
        prime.append(p)
        data = [e for e in data if e%p != 0]

def Factor(n,primes,k):
    factor = []
    power = []
    for p in primes:
        cnt = 0
        while n%p == 0:
            n //= p
            cnt += 1
        if cnt > 0:
            factor.append(p)
            power.append(cnt * k)
    
    if n != 1:
        factor.append(n)
        power.append(k)
    
    return factor,power

def main():
    n,k,m = map(int,input().split())
    primes = sieve(100000)
    factor,power = Factor(n,primes,k)
    
    l = len(factor)
    ans = 0
    stack = [(0,1)]
    while stack:
        i,num = stack.pop()
        if i == l:
            if num <= m:
                ans += 1
        else:
            stack.append((i + 1,num))
            p = num
            for _ in range(power[i]):
                p *= factor[i]
                if p <= m:
                    stack.append((i + 1,p))
                else:
                    break
    
    print(ans)
if __name__ =='__main__':
    main()