#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> istream& operator>>(istream &is, pair<T,U> &p){is >> p.first >> p.second; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

vector<pair<LLI,LLI>> prime_factorize(LLI n){
  vector<pair<LLI,LLI>> res;
  for(LLI i=2LL; i*i<=n; ++i){
    int c = 0;
    while(n%i==0){
      n/=i;
      ++c;
    }
    
    if(c){
      res.push_back({i,c});
    }
  }
  if(n!=1) res.push_back({n,1});
  return res;
}

int rec(const vector<pair<LLI,LLI>> &ps, int i, LLI m, LLI a){
  if(i >= (int)ps.size()) return 1;

  int ret = 0;
  
  REPE(j,ps[i].snd){
    if(a > m) break;

    ret += rec(ps,i+1,m,a);
    
    a *= ps[i].fst;
  }
  
  return ret;
}

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

  LLI n,k,m;
  while(cin >> n >> k >> m){

    auto primes = prime_factorize(n);
    for(auto &p : primes) p.snd *= k;

    int ans = rec(primes,0,m,1);
    
    cout << ans << endl;
    
  }
  
  
  return 0;
}