#pragma GCC optimize ("O3")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define UNIQUE(v) { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); }
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) {if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) (q ? "Yes" : "No")
#define YES(q) (q ? "YES" : "NO")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) { cerr << "[DEBUG] " #q ": ["; REP(dumpall_i, (q).size()) { cerr << q[dumpall_i] << (dumpall_i == (q).size() - 1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; }
template<class T> T gcd(const T &a, const T &b) { return a < b ? gcd(b, a) : b ? gcd(b, a % b) : a; }
template<class T> T lcm(const T &a, const T &b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
using  ll = long long;
using ull = unsigned long long;
using  ld = long double;
using namespace std;

// モジュール
vector<ll> factorize(ll n) {

    if (n < 2) return vector<ll>();

    vector<ll> ans;
    ll n0 = n;
    while (n % 2 == 0) {
        ans.push_back(2);
        n /= 2;
    }
    for (ll i = 3; i * i <= n0; i += 2) {
        while (n % i == 0) {
            ans.push_back(i);
            n /= i;
        }
    }
    if (n > 1) ans.push_back(n);
    return ans;

}

ll reconstruct(const vector<pair<ll, ll>> &p, ll limit = -1) {

    ll r = 1;
    REP(i, limit < 0 ? p.size() : min(limit, (ll)p.size())) {
        for (ll j = p[i].second; j--; ) {
            r *= p[i].first;
        }
    }
    return r;

}

ll solve(vector<pair<ll, ll>> &s, const vector<pair<ll, ll>> &pfac, ll m, ll d) {
    
    if (d >= pfac.size()) {

        ll x = reconstruct(s);
        // REP(i, s.size()) cerr << "[" << s[i].first << " ^ " << s[i].second << "] "; cerr << endl;
        return x <= m;

    } else {

        ll ans = 0;
        REP(i, pfac[d].second + 1) {
            s[d].second = i;
            ll rec = reconstruct(s, d + 1);
            if (m < rec) break;
            ans += solve(s, pfac, m, d + 1);
        }
        return ans;

    }

}

// 処理内容
int main() {
    
    ll n, k, m; cin >> n >> k >> m;
    
    vector<ll> nfac = factorize(n);
    ll facsize = nfac.size();

    vector<pair<ll, ll>> pfac;
    for (ll i = 0; i < facsize; ) {
        ll j = i;
        while (j < facsize && nfac[i] == nfac[j]) j++;
        pfac.emplace_back(nfac[i], (j - i) * k);
        i = j;
    }

    vector<pair<ll, ll>> s = pfac;
    for (auto &si : s) si.second = 0;
    cout << solve(s, pfac, m, 0) << endl;
    
}