from heapq import *

def f(n, k, m):
    if n == 1:
        print(1)
        exit()
    tei = []
    sis = []
    cnt = 0
    while n % 2 == 0:
        n //= 2
        cnt += 1
    if cnt:
        tei = [2]
        sis = [cnt * k]
    i = 3
    while i ** 2 <= n:
        cnt = 0
        while n % i == 0:
            cnt += 1
            n //= i
        if cnt:
            tei += [i]
            sis += [cnt * k]
        i += 2
    if n > 1:
        tei += [n]
        sis += [k]
    # print(sis)
    # print(tei)
    kos = len(tei)
    hp = []
    a = [0] * kos
    heappush(hp, [1] + a)
    used = set()
    cnt = 0
    while 1:
        y, *a = heappop(hp)
        if y > m: break
        for i in range(kos):
            if a[i] == sis[i]: continue
            ny = y * tei[i]
            na = a[:]
            na[i] += 1
            if ny in used: continue
            heappush(hp, [ny] + na)
            used.add(ny)
        cnt += 1
    print(cnt)

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