// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int64_t;
using ull = uint64_t;
using PLL = P<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
#include "../debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

V<PLL> pcnt;
ll N, M, K;

ll calc(ll pidx, ll now = 1) {
    if(pcnt.size() <= pidx) return 1;
    ll ret = calc(pidx + 1, now);
    ll p, cnt;
    tie(p, cnt) = pcnt[pidx];
    for(ll i = 0; i < cnt * K; i++) {
        now *= p;
        if(M < now) break;
        ret += calc(pidx + 1, now);
    }
    return ret;
}


int main() {
    cin >> N >> K >> M;
    ll NN = N;
    for(ll i = 2; i * i <= N; i++) {
        ll cnt = 0;
        while(NN % i == 0) {
            NN /= i;
            cnt++;
        }
        if(cnt) pcnt.emplace_back(i, cnt);
    }
    if(NN > 1) pcnt.emplace_back(NN, 1);
    cout << calc(0) << endl; 
    return 0;
}