#!/usr/bin/env python3
from math import log

ans = 1


def p_factor(n):
    p_cnt = {}
    for i in range(2, int(n**0.5) + 2):
        while n % i == 0:
            n //= i
            p_cnt[i] = p_cnt[i] + 1 if i in p_cnt else 1
    if n > 1:
        p_cnt[n] = p_cnt[n] + 1 if n in p_cnt else 1
    return p_cnt


def dfs(p_cnt, r, k):
    global ans
    if k < 0:
        ans += 1
        return
    a, e = p_cnt[k]
    for i in range(e + 1):
        q = r // a**i
        if q > 0:
            dfs(p_cnt, q, k - 1)


def main():
    n, k, m = map(int, input().split())
    p_cnt = p_factor(n)
    for i, x in p_cnt.items():
        p_cnt[i] = min(k * x, int(log(m, i)))
    dfs(sorted(p_cnt.items()), m, len(p_cnt) - 1)
    print(ans - 1)


if __name__ == '__main__':
    main()