#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

//firstに素因数、secondに素因数が何個あるか
vector<pair<long long, long long> > prime_factorize(long long n) {
    vector<pair<long long, long long> > res;
    for (long long p = 2; p * p <= n; ++p) {
        if (n % p != 0) continue;
        int num = 0;
        while (n % p == 0) { ++num; n /= p; }
        res.push_back(make_pair(p, num));
    }
    if (n != 1) res.push_back(make_pair(n, 1));
    return res;
}


signed main(){
    ios::sync_with_stdio(false);
	cin.tie(0);

   ll n,k,m;
   cin>>n>>k>>m;
   vector<pair<ll,ll>> v = prime_factorize(n);
   for(int i=0;i<v.size();i++){
       v[i].second *= k;
   }
   ll ans=0;
   set<ll> st;
   st.insert(1);
   for(int i=0;i<v.size();i++){
       set<ll> s2;
       s2.insert(1);
       for(auto j:st){
           ll now = j;
           ll cnt=0;
           s2.insert(j);
           while(cnt<v[i].second && now<=m){
               now *= v[i].first;
               if(now<=m){
                   s2.insert(now);
               }           
               cnt++;
           }
       }
       st=s2;
   }
   cout<<st.size()<<endl;


}