#include<iostream>
#include<vector>
using namespace std;
long N,K,M;
vector<pair<int,long> >A;
long dfs(long now,int id)
{
	if(id==A.size())
	{
		return now<=M;
	}
	long ret=0;
	for(int i=0;i<=A[id].second;i++)
	{
		ret+=dfs(now,id+1);
		now*=A[id].first;
		if(now>M)break;
	}
	return ret;
}
main()
{
	cin>>N>>K>>M;
	for(long i=2;i*i<=N;i++)
	{
		if(N%i==0)
		{
			A.push_back(make_pair(i,0));
			while(N%i==0)
			{
				A.back().second+=K;
				N/=i;
			}
		}
	}
	if(N>1)A.push_back(make_pair(N,K));
	cout<<dfs(1,0)<<endl;
}