#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;};
constexpr ll MOD=998244353;
constexpr ll INF=2e18;

ll g(ll l, ll r, ll p){
    return r/p-(l-1)/p;
}

ll f(ll n, ll k, ll p){
    ll res=0;
    ll q=1;
    while(1e18/q>p){
        q*=p;
        res+=g(n-k+1,n,q);
        res-=g(1,k,q);
    }
    return res;
}

int main(){
    ll n, k, m; cin >> n >> k >> m;
    ll x=m;
    ll ans=INF;
    for(ll i=2;i*i<=m;i++){
        ll cnt=0;
        while(x%i==0){
            cnt++;
            x/=i;
        }
        if(cnt==0)
            continue;
        ll res=f(n,k,i);
        chmin(ans,res/cnt);
    }
    if(x>1)
        chmin(ans,f(n,k,x));
    cout << ans << endl;
    return 0;
}