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

map<int64_t, int64_t> prime_division(int64_t n){
    map<int64_t, int64_t> ret;
    for(int64_t i=2; i*i<=n; i++){
        while(n % i == 0){
            n /= i;
            ret[i]++;
        }
    }
    if(n > 1) ret[n] = 1;
    return ret;
}

int main(){
    int64_t N, K, M;
    cin >> N >> K >> M;
    auto primes = prime_division(N);

    vector<int> dp = {1};
    for(auto& pr : primes){
        int p = pr.first;
        int64_t mx = pr.second * K;
        vector<int> dp2;
        for(int64_t a : dp){
            for(int t=0; t<mx; t++){
                a *= p;
                if(a > M) break;
                dp2.push_back(a);
            }
        }
        for(int a : dp2) dp.push_back(a);
    }
    cout << dp.size() << endl;
    return 0;
}