#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;

/*
924844033 1000000000 924844033
10 10 10
264577 10 10000000000
1 1 3
5040 1000000000 1000000000
*/

void prime_list(ll n,vector<ll>& p){
	ll visited[300010]={};
	reg(i,2,n){
		if(visited[i]==0){
			p.push_back(i);
			reg(j,2,n){
				if(j*i>n)break;
				visited[i*j]=1;
			}
		}
	}
}
void factoring(ll n,vector<pair<ll,ll>>& v,vector<ll>& p){
	rep(i,p.size()){
		while(n%p[i]==0){
			n/=p[i];
			if(v.size()==0 || v.back().first!=p[i])v.push_back({p[i],0});
			v.back().second++;
		}
	}
	if(n>1)v.push_back({n,1});
}

ll n,k,m;
vector<ll> prime;
vector<pair<ll,ll>> fact;

ll f(ll x,ll t){
	if(x>m)return 0;
	if(t==fact.size()){
		// cerr<<"solve :"<<x<<endl;
		return 1;
	}
	ll tmp=1,ans=0;
	for(ll i=0;i<=fact[t].second;i++){
		if(x*tmp>m)break;
		ans+=f(x*tmp,t+1);
		tmp*=fact[t].first;
	}
	return ans;
}

void init(){
	cin>>n>>k>>m;
	prime_list(200000,prime);
	factoring(n,fact,prime);
	rep(i,fact.size())fact[i].second*=k;
	// rep(i,fact.size())cerr<<fact[i].first<<","<<fact[i].second<<endl;
}

int main(void){
	init();
	cout<<f(1,0)<<endl;
	return 0;
}