#include <bits/stdc++.h>
#define rep(i, n) for(long long i = 0; i < (long long)(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;

// 素因数分解(first要素がfactで、second要素がその個数)
vector<pair<ll, ll>> prime_factorize(ll n) {
    vector<pair<ll, ll>> res;
    for (ll p = 2; p * p <= n; ++p) {
        if (n % p != 0) continue;
        int num = 0;
        while (n % p == 0) { ++num; n /= p; }
        res.push_back(make_pair(p, num));
    }
    if (n != 1) res.push_back(make_pair(n, 1));
    return res;
}

vector<P> fact;
int ans = 0;
ll m;

void dfs(int n, ll sum){
    if(fact.size() == n) return;
    if(sum > m) return;
    dfs(n+1, sum);
    rep(i, fact[n].second){
        sum *= fact[n].first;
        //cout << "s = " << sum << endl;
        if(sum > m) break;
        if(sum <= m) ans++;
        dfs(n+1, sum);
    }
}


int main(){
    ll n, k;
    cin >> n >> k >> m;

    fact = prime_factorize(n);

    rep(i, fact.size()){
        fact[i].second *= k;
    }

    /*
    for(auto p: fact){
        cout << "fact: " << p.first << ", N: " << p.second << endl;
    }
    */

    dfs(0, 1);
    cout << ans+1 << endl;
}