#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using P = pair<ll, int>;

vector<P> factorize(ll x){
    ll y = x;
    vector<P> ans;
    for(ll p = 2; p*p <= x; p++){
        int cnt = 0;
        while(y%p == 0){
            y /= p;
            cnt++;
        }
        if(cnt != 0){
            ans.push_back(P(p, cnt));
        }
    }
    if(y != 1) ans.push_back(P(y, 1));
    return ans;
}

// x!がpで何回割り切れるか
ll count(ll x, ll p){
    ll cur = p;
    ll ans = 0;
    while(true){
        ans += x/cur;
        if(cur > x/p) break;
        cur *= p;
    }
    return ans;
}

ll inf = 2e18;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    ll n, k, m; cin >> n >> k >> m;
    ll ans = inf;
    auto v = factorize(m);
    for(auto [p, cnt]: v){
        ll x = count(n, p) - count(k, p) - count(n-k, p);
        chmin(ans, x/cnt);
    }
    cout << ans << endl;
}