#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;

// O(√n) time
vector<pair<int, int>> prime_factor(int n) {
    vector<pair<int, int>> res;
    for (int i = 2; i * i <= n; i++) {
        int cnt = 0;
        while (n % i == 0) {
            n /= i;
            cnt++;
        }
        if (cnt) res.emplace_back(i, cnt);
    }
    if (n != 1) res.emplace_back(n, 1);
    return res;
}

int N, K, M;

int dfs(int x, int idx, vector<pair<int, int>>& pf) {
    if (idx == pf.size()) return 1;
    int k = 1, res = 0;
    REP (i, pf[idx].second * K + 1) {
        res += dfs(x * k, idx + 1, pf);
        k *= pf[idx].first;
        if (x > M / k) break;
    }
    return res;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> K >> M;
    auto pf = prime_factor(N);
    cout << dfs(1, 0, pf) << endl;
}