#include "bits/stdc++.h"
using namespace std;
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--)
#define put(a) cout<<a<<"\n"
#define all(a)  (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define oorret 0
#define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
template<typename T1, typename T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; }
template<typename T1, typename T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; }

ll n, k, m; 
set<ll> s;

void dfs(vector<int> a,vector<ll>& soinsu,vector<vector<ll>>& dp, ll pro=1) {
	
	REP(i, a.size()) {
		if (a[i] < dp[i].size()) {
			vector<int> next(a.size());
			REP(j, a.size()) {
				next[j] = a[j];
			}
			next[i]++;
			ll temp = pro * soinsu[i];
			if (temp <= m){
				auto itr = s.find(temp);
				if (itr == s.end()) {
					s.insert(temp);
					dfs(next, soinsu, dp, pro* soinsu[i]);
				}
				
			}
			
		}
	}
}

int main() {
	
	cin >> n >> k >> m;
	vector<ll> soinsu;
	vector<ll> shisu;
	for (int i = 2; i * i <= n; ++i) {
		if (n % i == 0) {
			soinsu.push_back(i);
			shisu.push_back(1);
			n /= i;
		}
		while (n % i == 0) {
			n /= i;
			shisu.back()++;
		}
	}
	if (n != 1) {
		soinsu.push_back(n);
		shisu.push_back(1);
	}
	int l = shisu.size();
	REP(i,l) {
		shisu[i] *= k;
	}
	vector<vector<ll>> dp(l);
	REP(i, l) {
		ll  temp = 1;
		for (int j = 0; j <= shisu[i] && temp <= m; ++j) {
			dp[i].push_back(temp);
			temp *= soinsu[i];
		}
	}
	vector<int> a(l, 1);
	s.insert(1);
	dfs(a,soinsu,dp);
	put(s.size());
	return 0;
}