#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int N, K, M;
    cin >> N >> K >> M;

    int X = N;
    map<int, int> prime;
    for(int i = 2; i * i <= X; ++i){
        while(X % i == 0){
            prime[i] += 1;
            X /= i;
        }
    }
    if(X != 1)  prime[X] = 1;

    map<ll, int> mp;
    mp[1] = 1;
    for(auto [p, c] : prime){
        auto nxt = mp;
        for(auto [key, val] : mp){
            ll num = key;
            for(ll i = 0; i < (ll)c * K; ++i){
                if((num *= p) > M)  break;
                nxt[num] += 1;
            }
        }
        mp = move(nxt);
    }

    cout << mp.size() << endl;

    return 0;
}