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

llong multi(llong base, int exp) {
    if(exp == 0) return 1;
    if(exp == 1) return base;
    return multi(base, exp/2) * multi(base, exp/2) * multi(base, exp%2);
}

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

    map<int, llong> primes;
    for(int i=2; i<=(int)sqrt(n); i++) {
        while(n % i == 0) {
            n /= i;
            primes[i] += 1;
        }
        if(n == 1) break;
    }
    if(n > 1) primes[n] = 1;

    for(pair<int, llong> p: primes) {
        primes[p.first] *= k;
    }

    vector<int> result;
    result.push_back(1);
    for(pair<int, int> p: primes) {
        int limit = result.size();
        for(int i=1; i<=p.second; i++) {
            llong val = multi(p.first, i);
            if(val > m) break;
            rep(j, limit) {
                if(result[j] * val > m) break;
                result.push_back(result[j] * val);
            }
        }
        sort(result.begin(), result.end());
    }
    cout << result.size() << endl;
}