// template version 1.12
using namespace std;
#include <iostream>
#include <bits/stdc++.h>

// varibable settings
#define infile "../test/sample-1.in"
#define int long long //{{{
const int INF=1e18;
const int MOD=1e9+7; //}}}

int res=0;
int n,k,m;
map<int, int> ps;
vector<pair<int, int>> ps2;
int prime_cnt;

// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;

template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

#if defined(PCM) || defined(LOCAL)
  #include "lib/dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}
map<int, int> prime_factor(int n) { // 素因数分解 (o(√N)){{{
  map<int, int> res;  // vectorで持つことも考えられる。
  for(int i = 2; i * i <= n; i++) {
    while(n % i == 0) {
      ++res[i];
      n /= i;
    }
  }
  if (n != 1) res[n] += 1;
  return res;
}
// (参考)http://pakapa104.hatenablog.com/entry/2016/02/09/230443
//}}}

int dfs(int i, int mul){
  int v = ps2[i].first;
  int M = ps2[i].second;
  rep(j, M+1){
    if (mul<=m) {
      if (i==prime_cnt-1){ res++; }
      else{ dfs(i+1, mul); }
    }
    mul *= v;
    if (mul>m) break;
  }
  return 0;
}

int solve(){
  cin>>n>>k>>m;
  ps = prime_factor(n);

  each(p, ps){
    if (p.first > m) continue;
    p.second *= k;
    ps2.pb(p);
  }
  dump(ps);
  dump(ps2);
  prime_cnt = sz(ps2);
  if (prime_cnt==0){
    cout << 1 << endl;
    return 0;
  }
  dfs(0, 1);
  cout << res << endl;

  return 0;
}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
  solve();
  return 0;
} //}}}