#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

ll n, k, m;
vector<pair<ll, ll>> fac;
set<ll> ans;

template<class T>
vector<pair<T, ll>> factorize(T n) {
    vector<pair<T, ll>> res;
    for (long long i = 2; (i * i) <= n; i++) {
        if (n % i) continue;
        res.emplace_back(i, 0);
        while((n % i) == 0) {
            n /= i;
            res.back().second++;
        }
    }
    if (n != 1) res.emplace_back(n, 1);
    return res;
}

void dfs(ll v, ll d = 0) {
    if (d == sz(fac)) {
        ans.insert(v);
        return;
    }
    ll mul = 1;
    rep(i, fac[d].second + 1) {
        ll cv = v * mul;
        if (cv > m) break;
        dfs(cv, d + 1);
        mul *= fac[d].first;
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    cin >> n >> k >> m;
    fac = factorize(n);
    for(auto &x : fac) x.second *= k;
    dfs(1);
    cout << sz(ans) << endl;
    return 0;
}