#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
using Pll = pair<ll,ll>;
const int INF = 1e9;
const int MOD = 1000000007;
ll n,k,m;
vector<ll> diviser;
vector<Pll> prime;

vector<pair<long long,long long>> getPrimes_(ll x){
        vector<pair<long long,long long>> res;
        for(ll i = 2; i * i <= x;i++){
                if(x%i ==0){
                        res.push_back(make_pair(i,0));
                        while(x%i ==0) x /= i,res.back().second += k;
                }
        }
        if( x > 1) res.push_back(make_pair(x,k));
        return res;
}

void dfs(int i,int d,ll now){
    if(i == d) diviser.push_back(now);
    else{
        ll res = 1;
        rep(j,prime[i].second+1){
            if(res * now > m) break;
            dfs(i+1,d,now*res);
            res *= prime[i].first;
        }
    }
}

int main(){
    cin >> n >> k >> m;
    prime = getPrimes_(n);
    dfs(0,prime.size(),1);
    cout << diviser.size() << endl;
    return 0;
}