//#define NDEBUG
#include <cstddef>
#include <cstdint>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

constexpr usize operator"" _z(unsigned long long x) noexcept {
  return static_cast<usize>(x);
}

class rep {
  const usize f, l;

public:
  class itr {
    friend rep;
    usize i;
    constexpr itr(const usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr rep(const usize first, const usize last) noexcept
      : f(first), l(last) {}
  constexpr itr begin() const noexcept { return itr(f); }
  constexpr itr end() const noexcept { return itr(l); }
};
class revrep {
  const usize f, l;

public:
  class itr {
    friend revrep;
    usize i;
    constexpr itr(usize x) noexcept : i(x) {}

  public:
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}
  constexpr itr begin() const noexcept { return itr(l); }
  constexpr itr end() const noexcept { return itr(f); }
};
template <class T> using vec_alias = std::vector<T>;
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) {
  return a < b ? b - a : a - b;
}

} // namespace n91

#include <algorithm>
#include <iostream>
#include <queue>
#include <utility>

namespace n91 {

void main_() {
  u64 n, k, m;
  std::cin >> n >> k >> m;
  struct factor {
    u64 p;
    u64 k;
  };
  std::vector<factor> fs;
  for (u64 i = static_cast<u64>(2); i * i <= n; ++i) {
    if (n % i == static_cast<u64>(0)) {
      fs.push_back({i, static_cast<u64>(0)});
      while (n % i == static_cast<u64>(0)) {
        n /= i;
        fs.back().k += k;
      }
    }
  }
  if (n != static_cast<u64>(1)) {
    fs.push_back({n, k});
  }
  const auto f = [&](const auto &f, const usize i, u64 acc) {
    if (i == fs.size()) {
      return 1_z;
    }
    usize ret = 0_z;
    for (u64 j = static_cast<u64>(0); j <= fs[i].k && acc <= m; ++j) {
      ret += f(f, i + 1_z, acc);
      acc *= fs[i].p;
    }
    return ret;
  };
  std::cout << f(f, 0_z, static_cast<u64>(1)) << std::endl;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}