from collections import Counter, defaultdict

def factorization(n):
    if n == 1: return [1]
    res = []
    x = n
    y = 2
    while y * y <= x:
        while x % y == 0:
            res.append(y)
            x //= y
        y += 1
    if x > 1: res.append(x)
    return res

N, K, M = map(int, input().split())

if N == 1:
    print(1)

else:
    F = Counter(factorization(N))
    D = defaultdict(int)

    for x, k in F.items():
        for i in range(k * K + 1):
            if x**i > M:
                D[x] = i - 1
                break
        else:
            D[x] = k * K

    dp = defaultdict(int)
    dp[1] = True

    for x, k in D.items():
        tmp = set()
        for i in range(k):
            for j in dp.keys():
                if j * (x**(i + 1)) <= M:
                    tmp.add(j * (x**(i + 1)))
        for x in tmp:
            dp[x] = True

    print(len(dp))