#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;

vector<Pl> factorize(ll n){
    vector<Pl> div;
    ll d = n;
    for(ll i = 2; i*i <= n; i++){
        Pl p;
        if(d % i == 0){
            p = make_pair(i,0);
            while(d % i == 0){
                d /= i;
                p.second++;
            }
            div.emplace_back(p);
        }
    }
    if(d != 1) div.emplace_back(d,1);
    return div;
}

int dfs(vector<Pl> div, ll now,int M,int depth){
    if(depth == div.size()) return 1;

    int res = 0;
    ll tmp = 1;
    for(int i = 0; i <= div[depth].second; i++){
        res += dfs(div,now*tmp,M,depth+1);
        tmp *= div[depth].first;
        if(tmp*now > M) break;
    }
    return res;
    

}

int main(){
    int N,K,M; cin >> N >> K >> M;
    vector<Pl> div = factorize(N);
    for(auto &u : div){
        u.second *= K;
    }
    int ans = dfs(div,1,M,0);
    cout << ans << endl;

}