#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>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
ll n, k, m;
vector<P> fac;
ll d, ans;
void dfs(int i){
    if(i==fac.size()){
        ans++;
        return;
    }
    ll p=fac[i].first, e=fac[i].second;
    ll pp=1;
    for(int j=0; j<=min(k*e, (ll)(log((double)m)/log((double)p))); j++){
        d*=pp;
        dfs(i+1);
        d/=pp;
        pp*=p;
    }
}
int main()
{
    cin>>n>>k>>m;
    if(n==1){
        cout<<1<<endl;
        return 0;
    }
    for(ll i=2; i*i<=n; i++){
        if(n%i==0){
            ll e=0;
            while(n%i==0){
                n/=i;
                e++;
            }
            fac.push_back(P(i, e));
        }
    }
    if(n>1) fac.push_back(P(n, 1));
    d=1, ans=0;
    dfs(0);
    cout<<ans<<endl;
    return 0;
}