#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;

template<class Z> map<Z, int> factorize(Z n) {
  map<Z, int> res;
  for (Z i = 2; i * i <= n; ++i) while (n % i == 0) ++res[i], n /= i;
  if (n != 1) ++res[n];
  return res;
}

lint powll(lint a, int n) {
  assert(n >= 0);
  lint res = 1;
  for (; n > 0; a *= a, n >>= 1) if (n & 1) res *= a;
  return res;
}

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int n, k, m; cin >> n >> k >> m;
  k = min(k, 30);
  auto mp = factorize(n);
  V<> p;
  for (const auto& e : mp) p.push_back(e.first);
  lint t = 1;
  int res = 0;
  auto dfs = [&](const auto& dfs, int j) -> void {
    if (j == p.size()) {
      ++res;
      return;
    }
    for (int i = 0; i <= mp[p[j]] * k; ++i) {
      if (t * powll(p[j], i) > m) break;
      t *= powll(p[j], i);
      dfs(dfs, j + 1);
      t /= powll(p[j], i);
    }
  };
  dfs(dfs, 0);
  cout << res << '\n';
}