#include<bits/stdc++.h>
//ios::sync_with_stdio(false);
//cin.tie(0);
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll inf=1000000000000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(int i=n;i>=m;i--)
ll lmax(ll a,ll b){
    if(a<b)return b;
    else return a;
}
ll lmin(ll a,ll b){
    if(a<b)return a;
    else return b;
}
ll n,k,m;
vector<ll> pri;
bool prijud(ll n){
    for(int i=2;i*i<=n;i++){
        if(n%i==0)return false;
    }
    return true;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>k>>m;
    bool used[100010];
    fill(used,used+100010,false);
    rep(i,2,100010){
        if(used[i])continue;
        pri.push_back(i);
        for(int j=i;j<100010;j+=i)used[j]=true;
    }
    vector<pll> v;
    rep(i,0,pri.size()){
        if(pri[i]*pri[i]>n)break;
        if(n%pri[i]!=0)continue;
        ll cnt=0;
        ll u=n;
        while(u%pri[i]==0){
            cnt++;
            u/=pri[i];
        }
        if(cnt>0){
            v.push_back(make_pair(pri[i],cnt));
        }
        if(prijud(n/pri[i])){
            u=n;
            ll y=n/pri[i];
            if(n%y==0)v.push_back(make_pair(y,1));
            
        }
    }
    sort(v.begin(),v.end());
    rep(i,0,v.size()){
        v[i].second*=k;
    }
    queue<pair<vector<pll>,ll> >q;
    q.push(make_pair(v,1));
    set<ll> ans;
    while(q.size()>0){
        pair<vector<pll>,ll> p=q.front();q.pop();
        vector<pll> w=p.first;ll now=p.second;
        ans.insert(now);
        rep(i,0,w.size()){
            ll r=w[i].first;
            ll t=w[i].second;
            if(t==0)continue;
            vector<pll> ww=w;
            if(now*r<=m){
                ww[i]=make_pair(r,t-1);
                q.push(make_pair(ww,now*r));
            }
            
        }
    }
    ll anss=ans.size();
    cout<<anss<<endl;
}