#include <math.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, l, n) for (int i = (l); i < (n); i++)
#define ite(i, a) for(auto& i : a)
#define all(x) x.begin(), x.end()
#define lb lower_bound
#define ub upper_bound
#define lbi(A, x) (ll)(lb(all(A), x) - A.begin())
#define ubi(A, x) (ll)(ub(all(A), x) - A.begin())
using ll = long long;
using Pair = pair<int, int>;
template <class T>	using V = vector<T>;
template <class T>	using VV = V<V<T> >;
const ll INF = 1000000000000000001;
const int inf = 1001001001;
const ll mod = 1000000007;
const ll MOD = 998244353;
template <class T>  inline V<T> getList(int n) { V<T> res(n); rep(i, 0, n) { cin >> res[i]; }return res; }
template <class T>  inline VV<T> getGrid(int m, int n) { VV<T> res(m, V<T>(n)); rep(i, 0, m) { res[i] = getList<T>(n); }return res; }
inline V<int> dtois(string& s) { V<int> vec = {}; for (auto& e : s) { vec.push_back(e - '0'); } return vec; }


int main(void) {
	ll N, K, M;		cin >> N >> K >> M;

	VV<ll> p = {};
	for (ll i = 2; i * i <= M; i++) {
		ll cnt = 0;
		while (M % i == 0) {
			cnt++;
			M /= i;
		}
		if (cnt > 0) {
			p.push_back({ i,cnt });
		}
	}
	if (M > 1) {
		p.push_back({ M,1 });
	}

	ll ans = INF;
	ite(l, p) {
		ll a = 0;
		ll n = N, k = K, r = N - K;
		ll d = l[0], c = l[1];
		while (n) {
			n /= d;
			a += n;
		}
		while (k) {
			k /= d;
			a -= k;
		}
		while (r) {
			r /= d;
			a -= r;
		}
		ans = min(ans, a / c);
	}

	cout << ans << endl;
	return 0;
}