//#include <tourist>
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//g++ yarudake.cpp -std=c++17 -I .
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll n, m, k;
ll mpow(ll x, ll n)
{ //x^n(mod M)
    ll ans = 1;
    while (n != 0)
    {
        if (n & 1)
            ans = ans * x;
        x = x * x;
        n = n >> 1;
        if (ans > INF)
        {
            return 1e9+1;
        }
    }
    return ans;
}
map<ll, ll> prime_factor(ll n)
{
    map<ll, ll> res;
    for (ll i = 2; i * i <= n; i++)
    {
        while (n % i == 0)
        {
            ++res[i];
            n /= i;
        }
    }
    if (n != 1)
        res[n] = 1;
    return res;
}
ll dfs(int j, vector<pair<ll, ll>> &v, ll score)
{
    if (j == v.size())
    {
        //cout << score << "\n";
        if (score <= m)
            return 1;
        else
        {
            return 0;
        }
    }
    ll res = 0;
    for (ll i = 0; i <= v[j].second * k; i++)
    {

        if (score * mpow(v[j].first, i) > INF )
        {
            break;
        }
        res += dfs(j + 1, v, score * mpow(v[j].first, i));
    }
    return res;
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> k >> m;
    map<ll, ll> mp = prime_factor(n);
    vector<pair<ll, ll>> v;
    for (auto i = mp.begin(); i != mp.end(); i++)
    {
        v.push_back(make_pair(i->first, i->second));
        //cout<<v.back().first<<" "<<v.back().second<<"\n";
    }
    cout << dfs(0, v, ll(1)) << "\n";
}