#include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;

ll N,K,M;
map<ll,ll> m;
vector<ll> v; 

ll dfs(ll val,ll num,ll k){
    ll res = 1;
//    cerr << val << " " << num << " " << k << endl;
    for(ll i=num;i<(ll) v.size();i++){
        if(val*v[i]<=M){
            if(i!=num) res += dfs(val*v[i],i,1);
            else if(k+1<=m[v[i]]*K) res += dfs(val*v[i],i,k+1);
        }
    }
    return res;
}

int main(){
    cin >> N >> K >> M;
    ll n = N;
    for(ll i=2;i*i<=N;i++){
        if(n%i==0){
            v.push_back(i);
            while(n%i==0){
                m[i]++;
                n /= i;
            }
        }
    }
    if(n!=1){
        m[n]++;
        v.push_back(n);
    }//for(auto x:m) cerr << x.first << endl;
    cout << dfs(1,0,0) << endl;
}