#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

vector<pair<ll, ll>> fac;
void PrimeFactorInit(int x){
    if(x >= 2){
        for(int i = 2; i <= x; i++){
            if(i * i > x)break;
            if(x % i == 0){
                int cnt = 0;
                while(x % i == 0){
                    cnt++;
                    x /= i;
                }
                pair<int, int> p;
                p.first = i;
                p.second = cnt;
                fac.push_back(p);
            }
        }
        if(x > 1){
            pair<int, int> p;
            p.first = x;
            p.second = 1;
            fac.push_back(p);
        }
    }
}

int ans;
ll n, k, m;
void dfs(ll x, int now, int siz){
    rep(i,fac[now].second*k + 1){
        if(x <= m){
            if(now < siz-1){
                dfs(x, now+1, siz);
            }else{
                ans++;
            }
        }else{
            break;
        }
        x *= fac[now].first;
    }
}

int main() {
    
    cin >> n >> k >> m;
    PrimeFactorInit(n);
    // rep(i,fac.size())cout << fac[i].first << ' ' << fac[i].second << endl;
    if(n == 1){
        cout << '1' << endl;
        return 0;
    }
    dfs(1, 0, fac.size());

    cout << ans << endl;
    return 0;
}