#include <bits/stdc++.h>
#include <atcoder/all>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
// 任意長整数型
using Bint = mp::cpp_int;
// 仮数部が10進数で1024桁の浮動小数点数型(TLEしたら小さくする)
using Real = mp::number<mp::cpp_dec_float<1024>>;
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

class Primes{
    private:
        int size_p;
        vector<bool> is_p;
        vector<int> primes;
        vector<int> minfactor;
        vector<int> mobius;
        void eratos(int n){
            for(int i=2; i<=n; i++){
                if(minfactor[i] < i)continue;
                primes.emplace_back(i);
                mobius[i] = -1;
                is_p[i] =true;
                for(int j = 2*i; j<=n; j+=i){
                    minfactor[j] = min(i, minfactor[j]);
                    mobius[j] = ((j/i) % i == 0) ? 0 : -mobius[j];
                }
            }
        }
        
    public:
        Primes(int n){
            size_p = n;
            rep(i, size_p+1)is_p.emplace_back(false);
            rep(i, size_p+1)minfactor.emplace_back(i);
            rep(i, size_p+1)mobius.push_back(1);
            mobius[1] = 1;
            eratos(size_p);
            
        }

        bool isprime(int n){
            return is_p[n];
        }
        vector<int> listPrimes(){
            return primes;
        }
        int getMobius(int n){return mobius[n];}

};

Bint cnt(Bint n, Bint a){
    Bint res = 0;
    Bint w = a;
    while(w <= n){
        res += n/w;
        w *= a;
    }
    return res;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n, k, m; cin >> n >> k >> m;
    Primes pr((int)(sqrt(m)+1));
    ll w = m;
    map<ll, ll> mp;
    for(auto i : pr.listPrimes()){
        if(w % i != 0)continue;
        while(w % i == 0){
            mp[i]++;
            w /= i;
        }
        if(w == 1)break;
    }
    if(w > 1)mp[w]++;
    Bint ans = (Bint)4e18;
    for(auto p : mp){
        Bint j = p.first; 
        Bint c = cnt((Bint)n, j) - cnt((Bint)k, j) - cnt(Bint(n-k), j);
       
        if(ans > c / (Bint)p.second) ans = c/(Bint)p.second;  
    }cout << ans << endl;
    return 0;
}