first = input()
wk1 = first.split()
N = int(wk1[0])
K = int(wk1[1])
M = int(wk1[2])
Ans = 0
Ans_max = 0
break_flg = 0

for i in range(K):
    N = N ** (i+1)
    for j in range(Ans_max , int(N//2)+1):
        if j+1 > M:
            break_flg = 1
            break
        syo , amari = divmod(N,j+1)
        if amari == 0:
            Ans = Ans + 1
    if break_flg == 1:
        break
    Ans_max = int(N//2) + 1

print(Ans)