#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

ll mfact(ll c, ll p){
    ll res = c, temp = c;
    rep(i, p) {
        temp += K;
        if(INF / temp < res) return INF;
        else res *= temp;
    }
    return res;
}

ll calc(ll n){
    //number of f(X) = 1 if X <= n
    ll lb = 0, ub = (ll)2e+9;
    while(ub - lb > 1){
        ll cen = (ub + lb) / 2;
        (mfact(cen, 1) <= n ? lb : ub) = cen;
    }
    return lb;
}

bool if_b1(ll n){
    return calc(n) - calc(n - 1) > 0;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N>>K>>M;
    map<ll, int> f;
    for(ll b = 2; b <= 20; ++b){
        for(ll a = 1, key = mfact(a, b); key <= N; ++a){
            key = mfact(a, b);
            if(key <= N) {
                ++f[key];
            }
        }
    }
    map<int, int> num;
    num[1] = calc(N);
    for(auto &p : f){
        if(p.first > N) break;
        if(if_b1(p.first)){
            --num[1];
            ++num[p.second + 1];
        }else{
            ++num[p.second];
        }
    }
    cout<<num[M]<<endl;
}