import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines import numpy as np N,K,M = map(int,read().split()) U = 10 ** 5 is_prime = np.zeros(U,np.bool_) is_prime[2] = 1 is_prime[3::2] = 1 for p in range(3,U,2): if p*p > U: break if is_prime[p]: is_prime[p*p::p+p] = 0 primes = is_prime.nonzero()[0] pf = dict() for p in primes[N % primes==0]: e = 0 while N % p == 0: N //= p e += 1 pf[p] = e if N > 1: pf[N] = 1 div = set([1]) for p,e in pf.items(): add = [] pp = 1 for i in range(1,K*e+1): pp *= p if pp > M: break add += [x * pp for x in div] div |= set(x for x in add if x <= M) answer = len(div) print(answer)