#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>

using namespace std;
using i64 = int64_t;
using i32 = int32_t;
template<class T, class U> void init_n(vector<T>& v, size_t n, U x) 
{ v = vector<T>(n, x); }
template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }
template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0) 
{ v = vector<T>(n+o); for (size_t i=o; i<n+o; ++i) cin >> v[i]; }
template<class T> void read_n(T a[], size_t n, size_t o = 0)
{ for (size_t i=o; i<n+o; ++i) cin >> a[i]; }
template<class T> T gabs(const T& x) { return max(x, -x); }
#define abs gabs

i64 n, k, m;
vector<pair<i64, i64>> pf; 

i64 f(i64 x, i64 i) {
  if (i >= pf.size()) return 1;
  auto p = pf[i];
  i64 y, l; tie(y, l) = p;
  i64 res = 0;
  for (i64 j = 0; j <= l && x <= m; ++j, x *= y) {
    cerr << x << endl;
    res += f(x, i + 1);
  }
  return res;
}

int main() {
  cin >> n >> k >> m;
  i64 rn = sqrt(double(n));
  map<i64, i64> pfm;
  for (i64 x = 2; x <= rn; ++x) {
    while (n % x == 0) {
      pfm[x]++;
      n /= x;
    }
  }
  if (n != 1) pfm[n]++;
  for (auto p : pfm) {
    cerr << p.first << ' ' << p.second << endl;
    pf.emplace_back(p.first, k * p.second);
  }
  cout << f(1, 0) << endl;
  return 0;
}