#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>

using namespace std;

using ll =  long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;

constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};

int not_prime[1000001];

map<ll, ll> factorize(ll n){
    map<ll, ll> ret;
    ll i = 2;
    not_prime[2] = 0;
    fill(not_prime, not_prime+1000001, 0);
    while(n != 1 && i <= 1000000){
        if(not_prime[i]){
            ++i;
            continue;
        }
        ll j = i;
        while(j <= 1000000){
            not_prime[j] = 1;
            j += i;
        }

        while(n % i == 0){
            n /= i;
            ++ret[i];
        }

        ++i;
    }
    if(n != 1LL){
        ++ret[n];
    }
    return ret;
}

int main() {
    std::ios::sync_with_stdio(0); cin.tie(0);
    ll n,k,m;
    cin >> n >> k >> m;

    map<ll, ll> mp = factorize(n);

    vector<ll> divisors(1, 1);
    for(auto itr=mp.begin();itr!=mp.end();++itr) {
        ll f = itr->first;
        ll nf = (itr->second) * k;
        int nd = divisors.size();
        for(int i=0;i<nd;++i) {
            ll d = divisors[i];
            for(int j=1;j<=nf;++j) {
                d *= f;
                if(d > m) break;
                divisors.push_back(d);
            }
        }
    }

    cout << divisors.size() << endl;
}