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


def max2(x):
    ok = 0
    ng = 10**9
    while ng - ok > 1:
        m = (ok + ng) // 2
        if m * (m + k) <= x:
            ok = m
        else:
            ng = m
    return ok


def is_2(x):
    y = round(-k/2 + ((k/2)**2 + x)**0.5)
    return y*(y+k) == x


big2 = {}
for b in range(3, 20):
    i = 1
    while True:
        x = 1
        for j in range(b):
            x *= i + j * k
        if x > n:
            break
        if x in big2:
            big2[x] += 1
        else:
            big2[x] = 1
        i += 1

count_2 = max2(n)
for i in big2:
    if is_2(i):
        big2[i] += 1
        count_2 -= 1

ans = count_2 if m == 1 else 0
for i in big2.values():
    if i == m:
        ans += 1
print(ans)