#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------

map<ll, ll> prime_fac(ll x) {
    map<ll, ll> ans;
    for(int i=2;i*i<=x; i++) {
        while(x%i==0) {
            ans[i]++;
            x /= i;
        }
    }
    if(x!=1) ans[x]++;
    return ans;
}

vector<ll> prime;
vector<ll> cnt;
map<ll,ll> ans;

void dfs(int i, ll cur, ll m) {
    if(i >= cnt.size()) return;
    ll x = 1;
    ll k = 0;
    while(cur * x <= m and k <= cnt[i]) {
        if(i < prime.size()-1) dfs(i+1, cur*x, m);
        else ans[cur*x]++;
        x *= prime[i];
        k++;
    }
}

int main(){
    cin.tie(0); ios::sync_with_stdio(false); //cout << fixed << setprecision(15);
    ll n,k,m; cin >> n >> k >> m;
    
    auto mp = prime_fac(n);
    for(auto &[k1,v1]:mp) {
        prime.emplace_back(k1);
        cnt.emplace_back(v1*k);
    }

    ll res = 0;
    if(cnt.size() ==0) {
        res = 1;
    } else{
    dfs(0, 1, m);
    for(auto _: ans) res++;
    }
    cout << res << endl;
    return 0;
}