prime = []
numberlist = []
for i in range(2, 31623):
	numberlist.append(i)
while numberlist[0] <= 177:
	now = numberlist.pop(0)
	prime.append(now)
	newnumberlist = []
	for i in range(0, len(numberlist)):
		if numberlist[i]%now != 0:
			newnumberlist.append(numberlist[i])
	numberlist = newnumberlist
prime = prime + numberlist

N, K, M = map(int, input().split())
factorized = []
for i in range(0, len(prime)):
	if N % prime[i] == 0:
		factorized.append([prime[i], 1])
		N //= prime[i]
		while N % prime[i] == 0:
			factorized[-1][1] += 1
			N //= prime[i]
if N != 1:
	factorized.append([N, 1])
ans = [1]
for i in range(0, len(factorized)):
	X = len(ans)
	for j in range(0, len(ans)):
		Y = ans[j]
		cnt = 1
		while Y*factorized[i][0] <= M and cnt <= K*factorized[i][1]:
			Y *= factorized[i][0]
			ans.append(Y)
			cnt += 1
	ans.sort()
print(len(ans))