#include<fstream>
using namespace std;
FILE *g=fopen("diamant.out","w");
int i,j,n,m,d[1010],max1=0,a[22][22],p[]={-1,0,1},nr=0,r[1010],rez=0;
long long kt;
void back(int k)
{
	if(k==(n*m+1))
	{
		//int l1,l2;
		/*long long rez=0;
		for(l1=1;l1<=n;++l1)
			for(l2=1;l2<=m;++l2)
		        if(d[(l1-1)*m+l2]==-1)
					rez-=(l1*l2);
				else
					if(d[(l1-1)*m+l2]==1)
						rez+=(l1*l2);*/
					if(rez==kt)
						++nr;
					//rez=0;
		return;
	}
	for(int i=0;i<3;++i)
		if(d[k]!=p[i])
		{
			d[k]=p[i];
			if(d[k]==1)
				rez+=r[k];
			if(d[k]==-1)
				rez-=r[k];
			back(k+1);
			if(d[k]==1)
				rez-=r[k];
			if(d[k]==-1)
				rez+=r[k];
			//d[k]-=p[i];
		}
}
int main()
{
	FILE *f=fopen("diamant.in","r");
	fscanf(f,"%d%d%lld",&n,&m,&kt);
	for(i=1;i<=n;++i)
		for(j=1;j<=m;++j)
		d[(i-1)*m+j]=0,r[(i-1)*m+j]=i*j;
		back(1);
		fprintf(g,"%d ",nr);
		return 0;
}