#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll LINF = (1LL << 60) - 1LL;
constexpr double eps = 1e-9;
constexpr ll MOD = 1000000007LL;
template <typename T>
bool chmin(T& a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
};
template <typename T>
bool chmax(T& a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
};
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
    for(int i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "\n" : " ");
    }
    return os;
}
template <typename T>
vector<T> make_v(size_t a) {
    return vector<T>(a);
}
template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T& t, const V& v) {
    t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T& t, const V& v) {
    for(auto& e : t) {
        fill_v(e, v);
    }
};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, k, m;
    cin >> n >> k >> m;
    vector<ll> v;
    set<ll> st;
    for(ll i = 1; i <= sqrt(n); i++) {
        if(n % i == 0) {
            if(i <= m) {
                v.push_back(i);
                st.insert(i);
            }
            if(n / i <= m) {
                v.push_back(n / i);
                st.insert(n / i);
            }
        }
    }
    vector<ll> v2 = v;
    for(int i = 0; i < min(k - 1LL, 31LL); i++) {
        vector<ll> v3;
        for(int j = 0; j < v.size(); j++) {
            for(int k = 0; k < v2.size(); k++) {
                if(v[j] * v2[k] > m) {
                    continue;
                }
                if(st.count(v[j] * v2[k])) {
                    continue;
                }
                v3.push_back(v[j] * v2[k]);
                st.insert(v[j] * v2[k]);
            }
        }
        for(auto& e : v3) {
            v2.push_back(e);
        }
    }
    cout << st.size() << endl;
}