import sys
input = sys.stdin.readline

def prime_factorize(n):
    primes = []
    f = 2
    while(f * f <= n):
        if(n % f == 0):
            n //= f
            cnt = 1
            while(n % f == 0):
                n //= f
                cnt += 1
            primes.append((f, cnt))
        f += 1
    if(n != 1):
        primes.append((n, 1))
    return primes


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

primes = prime_factorize(M)
ans = 64
for p, c in primes:
    def legendre(N, K, p, c):
        R = N - K
        ret = 0
        while(N):
            N //= p
            ret += N
        while(K):
            K //= p
            ret -= K
        while(R):
            R //= p
            ret -= R
        return ret // c
    cnt = legendre(N, K, p, c)
    if(ans <= cnt):
        continue
    ans = cnt
print(ans)