#include <bits/stdc++.h>
using namespace std;
#define int long long 
const int mod = 1'000'000'007;
int qexp(int a, int b){
	int res=1;
	while(b){
		if(b&1)res=res*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return res;
}
int inv(int x){
	return qexp(x,mod-2);
}
int F[20];
int32_t main(){
	F[0]=1;
	for(int i=1;i<20;i++){
		F[i]=F[i-1]*i%mod;
	}
	int n,m,k;cin>>n>>m>>k;
	int S=n+k;
	vector<int>choices;
	for(int i=0;i<1<<S;i++){
		if(__builtin_popcount(i) == k){ // cuts
			choices.push_back(i);
		}
	}
	int tot=choices.size();
	int ans=0;
	for(auto x:choices){
		int ways=0;
		for(int j=0;j<S;j++){
			if(x & (1<<j) == 0){//not a cut
				if(j == 0 || (x & (1<<(j-1)))){ // previous guy was cut
					++ways;
				}
			}
		}
		ways=ways*F[n-1]%mod;
		ans=(ans+ways%mod)%mod;
	}
	cout<<ans*inv(F[n])%mod*inv(tot)%mod;
					
	
}