#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

vector<ll> prime;
vector<bool> is_prime(100000,true);
void Eratosthenes() {
    is_prime[0] = is_prime[1] = false;
    for (ll i = 2;i*i < 100000;++i) if (is_prime[i]) for (ll j = 2*i;j < 100000;j += i) is_prime[j] = false;
    for (ll i = 0;i < 100000;++i) if (is_prime[i]) prime.push_back(i);
}

vector<P> prime_factorization(ll a) {
    vector<P> prime_factor;
    if (is_prime[0]) Eratosthenes();
    for (ll& i : prime) {
        if (i*i > a) break;
        if (a%i == 0) {
            P p = P(i,0);
            while (a%i == 0) {
                a /= i;
                p.second++;
            }
            prime_factor.push_back(p);
        }
    }
    if (a != 1) prime_factor.push_back(P(a,1));
    return prime_factor;
}

void rec(vector<ll>& div,vector<P>& fact,int i,ll d,ll m) {
    // div.push_back(d);
    if (i == fact.size()) {
        div.push_back(d);
        return;
    }
    for (int j = 0;j <= fact[i].second;++j) {
        rec(div,fact,i+1,d,m);
        d *= fact[i].first;
        if (d > m) return;
    }
}

vector<ll> divisor(ll a,ll k,ll m) {
    vector<ll> div;
    vector<P> prime_factor = prime_factorization(a);
    for (P& p : prime_factor) p.second *= k;
    rec(div,prime_factor,0,1,m);
    return div;
}


int main() {
    ll n,k,m;
    cin >> n >> k >> m;
    vector<ll> div = divisor(n,k,m);
    cout << div.size() << endl;
    // p_ary(div,0,div.size(),i);
    return 0;
}