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

#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = long long;
using pll = pair<ll,ll>;
constexpr ll INF = (1LL<<60);
constexpr ll MOD = (1e9+7);
//constexpr ll MOD = (998244353);
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}return 0;}
void dump(){cout<<endl;}
template<class T,class... Ts> void dump(T&& h, Ts&&... t){cout<<h<<", ";dump(forward<Ts>(t)...);}
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T>vector<T> make_vector(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto make_vector(size_t a, Ts... ts){return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));}

void solve1();void solve2();
int main(){
  solve1();
  return 0;
}

ll mpow(ll n,ll p){
  ll ans=1LL;
  while(p){
    if(p&1)ans*=n;
    n*=n;
    p>>=1;
  }
  return ans;
}

void solve1(){

  ll n,k,m;
  cin>>n>>k>>m;

  auto prime_factorization = [](ll n){
    map<ll,ll> res;
    for(ll p=2;p*p<=n;++p){
      while(n%p==0){
        n/=p;
        res[p]++;
      }
    }
    if(n!=1)res[n]++;
    return res;
  };

  auto a = prime_factorization(n);

  vector<pll> fac;
  for(auto& [p,x]:a)fac.emplace_back(p,x*k);

  auto dfs = [&](auto&& dfs,ll i,ll prod)->ll{
    if(i==fac.size())return 1;
    ll res=0;
    rep(j,fac[i].second+1){
      if(prod*mpow(fac[i].first,j)>m)break;
      res += dfs(dfs,i+1,prod*mpow(fac[i].first,j));
    }
    return res;
  };

  ll ans = dfs(dfs,0,1);
  cout<<ans<<endl;

}