#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using VI = vector<int>;
using P = pair<int, int>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

ll f(ll x, ll y) {
    ll ret = 0;
    while (x > 0) {
        ret += x / y;
        x /= y;
    }
    return ret;
}

int main() {
    ll N, K, M;
    cin >> N >> K >> M;
    vector<pair<ll, int>> A;
    ll P = M;
    for (ll i = 2; i * i <= P; i++) {
        int count = 0;
        while (P % i == 0) {
            count++;
            P /= i;
        }
        if (count) A.push_back(make_pair(i, count));
    }
    if (P > 1) A.push_back(make_pair(P, 1));
    ll ans = LINF;
    for (auto i : A) {
        ll x = i.first, y = i.second;
        //cout << x << " " << y << endl;
        chmin(ans, (f(N, x) - f(N - K, x) - f(K, x)) / y);
    }
    cout << ans  << endl;
}