# 素数列挙
from collections import Counter


def prime_numbers(x: int) -> list:
	if x < 2:
		return []

	prime_numbers = [i for i in range(x)]
	prime_numbers[1] = 0

	for prime_number in prime_numbers:
		if prime_number ** 2 > x:
			break

		if prime_number == 0:
			continue

		for composite_number in range(2 * prime_number, x, prime_number):
			prime_numbers[composite_number] = 0

	return [prime_number for prime_number in prime_numbers if prime_number != 0]

# 素因数分解
def prime_factorize(n: int) -> list:
	res = []

	while n % 2 == 0:
		res.append(2)
		n //= 2

	f = 3

	while f ** 2 <= n:
		if n % f == 0:
			res.append(f)
			n //= f
		else:
			f += 2

	if n != 1:
		res.append(n)

	return res

n, k, m = map(int, input().split())
primes = prime_numbers(10 ** 6 + 10)
p = prime_factorize(m)
c = Counter(p)
f = set(p)
ans = 10 ** 18
for i in f:
	cnt = 0
	cur = i
	while cur <= n:
		cnt += n // cur - (n - k) // cur - k // cur
		cur *= i
	ans = min(ans, cnt // c[i])
print(ans)