#include <bits/stdc++.h>
using namespace std;

#define int long long

int tbl[100010] = {};
vector<int> so;
vector<int> soin;
int sonum[100010] = {};
int sip = 0;
int n, k, m;

int dfs(int i, int j, int num){
    if(i == sip){
        return 1;
    }

    if(j == sonum[i]){
        return dfs(i+1, 0, num);
    }

    if(num * soin[i] <= m){
        return dfs(i+1, 0, num) + dfs(i, j+1, num*soin[i]);
    }else{
        return dfs(i+1, 0, num);
    }
}

signed main(){

    cin >> n >> k >> m;

    for(int i = 2;i < 100010;i++){
        if(tbl[i] == 0){
            so.push_back(i);
            for(int j = i*2;j < 100010;j+=i){
                tbl[j] = 1;
            }
        }
    }

    int tmp = n;

    if(n == 1){
        cout << 1 << endl;
        return 0;
    }

    int sp = 0;

    while(tmp > 1){
        if(tmp % so[sp] == 0){
            soin.push_back(so[sp]);
            while(tmp % so[sp] == 0){
                sonum[sip]++;
                tmp /= so[sp];
            }
            sonum[sip] *= k;
            sip++;
        }

        sp++;

        if(tmp > 1 && sp == so.size()){
            soin.push_back(tmp);
            sonum[sip] = 1;
            sip++;
            break;
        }
    }


    cout << dfs(0, 0, 1) << endl;

    return 0;
}