#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,m,k,Mx;
unordered_map<int,int> mp;
ll ans,P[500005];
inline ll calc(int x){
	ll res=1;
	for(int i=1;i<=n;++i)
		res=min(res*x,m*(x+1ll)+1);
	return res;
}
int main(){
	while(~scanf("%d%d%d",&n,&m,&k)){
		ans=0;
		if(n==1){
			for(int i=-m;i<=m;++i)
				if(i!=-1 && k==1)ans+=m+m+1;
			printf("%lld\n",ans);
			continue;
		}
		if(n==2){
			if(k==1){
				for(int i=-m;i<=m;++i){
					ll a=(ll)i*i;
					if(a>m*4)continue;
					if(!(a&3))++ans;
				}
			}
			if(k==2){
				for(int i=0;i<=m;++i){
					ll a=(ll)i*i,b;
					for(int j=i;j>=1;--j){
						b=a-(ll)j*j;
						if(b>m*4)break;
						if(!(b&3))ans+=(i>0)+1;
					}
					for(int j=i+1;;++j){
						b=(ll)j*j-a;
						if(b>m*4)break;
						if(!(b&3))ans+=(i>0)+1;
					}
				}
			}
			printf("%lld\n",ans);
			continue;
		}
		Mx=0;
		for(int x=0;;++x){
			P[x]=calc(x);
			if(P[x]>m*(x+1ll))break;
			Mx=x;
		}
		for(int i=-m;i<=m;++i){
			mp.clear();
			for(int x=0;x<=Mx;++x){
				ll p=P[x],b=-p-(ll)i*x;
				if(-m<=b && b<=m)++mp[b];
				if(x>0){
					b=(n&1?p:-p)+(ll)i*x;
					if(-m<=b && b<=m)++mp[b];
				}
			}
			for(auto t:mp)if(t.second==k)++ans;
		}
		printf("%lld\n",ans);
	}
	return 0;
}