#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
mt19937 rnd(time(0));

const int N=5e5+3;

int n,m,k;
vector<int> cnt[N*2];
ll qpow(ll x,int y){
	ll r=1;
	for(;y;y>>=1){
		if(y&1)r=r*x;
		x=x*x;
	}
	return r;
}
void solve(){
	if(n<k){
		cout<<"0\n";
		return;
	}
	if(n==1){
		cout<<1ll*(2*m)*(2*m+1)<<'\n';
		return;
	}

	for(int i=0;i<=m*2;++i)cnt[i].clear();
	int mg;
	if(n<=20)mg=min(1.*m,2*pow(m,1./(n-1)));
	else mg=1;
	for(int a=-m;a<=m;++a)cnt[m].push_back(a);
	for(int x=-mg;x<=mg;++x)if(x!=0){
		ll xn=qpow(x,n),a=-xn/x;
		if(abs(a)<=m)cnt[m].push_back(a);
		for(int xx=abs(x),b=xx;b<=m;b+=xx){
			a=-(xn+b)/x;
			if(abs(a)<=m)cnt[b+m].push_back(a);
			a=-(xn-b)/x;
			if(abs(a)<=m)cnt[-b+m].push_back(a);
		}
	}
	int ans=0;
	vector<int> c(2*m+1);
	for(int i=0;i<=2*m;++i){
		for(int j:cnt[i]){
			++c[j+m];
			if(c[j+m]==k)++ans;
			if(c[j+m]==k+1)--ans;
		}
		for(int j:cnt[i])--c[j+m];
	}
	cout<<ans<<'\n';
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	while(cin>>n>>m>>k)solve();
}