import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N, K, M = map(int, input().split())
factors = defaultdict(int)
n = N
for i in range(2, N + 1):
    if i * i > N:
        break
    while n % i == 0:
        factors[i] += 1
        n //= i
if n > 1:
    factors[n] += 1
A = [(k, v) for k, v in factors.items()]


def dfs(n, idx):
    global ans
    if idx == len(A):
        ans += 1
        return

    k, v = A[idx]
    for i in range(v * K + 1):
        if n * pow(k, i) > M:
            break
        dfs(n * pow(k, i), idx + 1)


ans = 0
dfs(1, 0)
print(ans)