#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)

using namespace std;
using ll = long long;

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


int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  ll N, K, M;
  cin >> N >> K >> M;
  auto fs = factors(N);
  vector<pair<ll, ll>> cnt;
  for (auto f : fs) {
    cnt.emplace_back(f.first, f.second * K);
  }
  int ans = 0;
  auto dfs = [&](auto dfs, int k, ll p) {
    if (k == cnt.size()) {
      ans++;
      return;
    }
    for (int i = 0; i <= cnt[k].second; i++) {
      dfs(dfs, k + 1, p);
      p /= cnt[k].first;
      if (p == 0) break;
    }
  };
  dfs(dfs, 0, M);
  cout << ans << endl;
}