#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <ctime>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;
static const double EPS = 1e-10;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcount(b)
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)

#define delete(a,n) a.erase(remove(all(a),n),a.end())
template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; }
template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();}
bool isprime(int n){ if(n<2)return false;  for(int i=2;i*i<=n;i++)if(n%i==0)return false;  return true;} 
ll b_pow(ll x,ll n){return n ? b_pow(x*x,n/2)*(n%2?x:1) : 1ll;}
string itos(long long n){stringstream ss;ss << n;return ss.str();}

typedef unsigned int uint;
int in() {
    int x = 0, c;
    for (; (uint)((c = getchar()) - '0') >= 10; ) { if (c == '-') return -in(); if (!~c) throw ~0; }
    do { x = (x << 3) + (x << 1) + (c - '0'); } while ((uint)((c = getchar()) - '0') < 10);
    return x;
}

int cnt[30001];

class bigInteger{
#define DIGITMAX (1550) // 8 * n digit
public:
	int value[DIGITMAX];
 
	bigInteger operator=(bigInteger b){
		memcpy(this->value,b.value,sizeof(value));
		return *this;
	}
	/* with bug.. O(n^2) */
	// BigNum * MiniNum
	bigInteger operator*(bigInteger b){
		bigInteger ret;
		for(int i=0;i<DIGITMAX;i++){
			if( this->value[i] == 0 ) continue;
			for(int j=0;j<2;j++){
				if(i+j+1<DIGITMAX){
					ret.value[i+j] += this->value[i]*b.value[j];
					ret.value[i+j+1] += ret.value[i+j]/10000;
					ret.value[i+j] %= 10000;
				}
			}
		}
		return ret;
	}
 
	string str(){
		char tmp[5];
		string retVal = "";
		for(int i=DIGITMAX-1;i>=0;i--){
			sprintf(tmp,"%04d",value[i]);
			retVal += tmp;
		}
		while(retVal[0] == '0' && retVal.length()>=2)retVal = retVal.substr(1);
		return retVal;
	}
 
	bigInteger(){memset(this->value,0,sizeof(this->value));}
	bigInteger(string init){
		bigInteger();
		int k = 0;
		for(int i=init.length()-4;i>-4;i-=4){
			this->value[k++] = ( atoi(init.substr(max(i,0),4+(i<0?i:0)).c_str()) );
		}
	}
};

int main(){
	int n = in() , m = in() , r = in();
	int R = r - n * m;
	if( R < 0 ){
		cout << 0 << endl;
		return 0;
	}
	// R=2,R=3 |O|O -> (R+n-1) C (n-1)
	for(int i_ = 0 ; i_ < n-1 ; i_++){
		int N = n-1+R-i_;
		for(int j = 2 ; j*j <= N ; j++)
			while(N%j==0) cnt[j]++ , N/=j;
		cnt[N]++;
	}
	for(int i_ = 0 ; i_ < n-1 ; i_++){
		int N = i_+1;
		for(int j = 2 ; j*j <= N ; j++)
			while(N%j==0) cnt[j]-- , N/=j;
		cnt[N]--;
	}
	bigInteger ans("1");
	for(int i = 2 ; i <= 30000 ; i++){
	
		while( cnt[i]-- ) ans = ans * bigInteger( itos(i) );
	}
	cout << ans.str() << endl;
}
	

Measured memory_bytes: 1428