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


def count(x, p):
    res = 0
    v = p
    while v <= x:
        res += x//v
        v *= p
    return res


def factorization(n):
    if n == 1:
        return [[1, 1]]
    temp = n
    ans = []
    for i in range(2, int(n**0.5+1.01)):
        if temp % i == 0:
            ct = 0
            while temp % i == 0:
                temp //= i
                ct += 1
            ans.append([i, ct])
    if temp != 1:
        ans.append([temp, 1])
    return ans


A = factorization(M)
ans = 10**18
for p, c in A:
    v = count(N, p)-count(N-K, p)-count(K, p)
    ans = min(ans, v//c)
print(ans)