#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    ll n, k, M; cin>>n>>k>>M;
    using lll=__int128_t;
    map<ll, int> mp;
    for(int i=2; i<=19; i++){
        int myon=0;
        for(lll a=1; ; a++){
            lll p=1;
            for(lll j=0; j<=i; j++){
                p*=(a+j*k);
                p=min(p, (lll)(n+1));
            }
            mp[p]^=(1<<i);
            if(p==n+1){
                myon=a;
                break;
            }
        }
        if(myon==1) break;
    }
    int c=0;
    for(auto &p:mp){
        ll x=p.first;
        ll l=0, r=1e9;
        while(r-l>1){
            lll m=(l+r)/2;
            if(m*(m+k)>=x) r=m;
            else l=m;
        }
        if((lll)r*(r+k)==x){
            p.second^=2;
            c++;
        }
    }
    if(M>=2){
        int ans=0;
        for(auto p:mp){
            if(popcount(p.second)==M) ans++;
        }
        cout<<ans<<endl;
        return 0;
    }
    ll l=0, r=1e9;
    while(r-l>1){
        lll m=(l+r)/2;
        if(m*(m+k)<=n) l=m;
        else r=m;
    }
    ll ans=l-c;
    for(auto p:mp){
        if(popcount(p.second)==1) ans++;
    }
    cout<<ans<<endl;
    return 0;
}