#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
    for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

map<ll, ll> factorize(ll x) {
    map<ll, ll> ret;
    ll d, q;
    while (x >= 4 && x % 2 == 0) {
        ret[2]++;
        x /= 2;
    }
    d = 3;
    q = x / d;
    while (q >= d) {
        if (x % d == 0) {
            ret[d]++;
            x = q;
        } else {
            d += 2;
        }
        q = x / d;
    }
    ret[x]++;
    return ret;
}

ll ret;

void solve(ll M, ll now, int idx, const vector<pair<ll, ll>>& fv) {
    if (idx >= fv.size()) {
        if (now <= M)
            ret++;
        return;
    }
    ll p = fv[idx].first;
    ll k = fv[idx].second;

    int kk = 0;
    while (kk <= k && now <= M) {
        solve(M, now, idx + 1, fv);
        kk++;
        now *= p;
    }
}

int main() {
    ll N, K, M;
    cin >> N >> K >> M;

    if (N == 1) {
        cout << 1 << endl;
        return 0;
    }

    map<ll, ll> fact = factorize(N);
    vector<pair<ll, ll>> fv;
    for (const auto& p : fact) fv.emplace_back(p.first, p.second * K);
    reverse(ALLOF(fv));

    ret = 0;
    solve(M, 1, 0, fv);
    cout << ret << endl;

    return 0;
}