#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=5e5+5,M=N*60+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
int n,m,k;
pii A[M],B[M];int w[M];int H,BB;
void Solve(){
	int i,j;if(scanf("%d%d%d",&n,&m,&k)==-1) exit(0);
	if(n==1) {
		if(k^1) {puts("0");return;}
		printf("%lld\n",1ll*(2*m+1)*(2*m));
		return;
	}
	H=0;
	for(i=1;;i++){
		if(i>=2&&n>=30) break;
		ll x=1;
		if(i^1) for(j=1;j<=n;j++) x*=i;
		if(abs(x)>1ll*i*m+m) break;
		ll low=max(ceil((-x-m)*1.0/i),-1.0*m),up=min(floor((m-x)*1.0/i),1.0*m);
		for(j=low;j<=up;j++) A[++H]=make_pair(j,-x-1ll*i*j);
	}
	for(i=-1;;i--){
		if(i<=-2&&n>=30) break;
		ll x=1;
		if(i!=-1) for(j=1;j<=n;j++) x*=i;
		else x=(n&1?-1:1);
		if(abs(x)>=1ll*-i*m+m) break;
		ll low=max(ceil((m-x)*1.0/i),-1.0*m),up=min(floor((-x-m)*1.0/i),1.0*m);
		for(j=low;j<=up;j++) A[++H]=make_pair(j,-x-1ll*i*j);
	}
	sort(A+1,A+H+1);BB=0;
	for(i=1;i<=H;i++) if(i==1||A[i]!=B[BB]) B[++BB]=A[i],w[BB]=1;else w[BB]++; 
	int ans=0;
	for(i=1;i<=BB;i++) if(w[i]+(B[i].se==0)==k) ans++;
	if(k==1){
		ans+=2*m+1;
		for(i=1;i<=BB;i++) if(B[i].se==0) ans--;
	}
	printf("%d\n",ans);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(1) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}