Codeforces Round #767 (Div. 1) D1. Game on Sum (Easy Version)

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long 
const int N=2e3+10;
const int mod=1e9+7;
int t,m,n,dp[N][N],k;
int qpow(int a,int b){
	int res=1;
	while(b){
		if(b%2==1) res=res*a%mod;
		a=a*a%mod;
		b=b>>1;		
	}
	return res;
}
int32_t main(){
	for(int i=1;i<N;i++) dp[i][i]=i;
	int tp=qpow(2,mod-2);
	for(int i=2;i<N;i++){
		for(int j=1;j<i;j++){
			dp[i][j]=(dp[i-1][j-1]+dp[i-1][j])*tp%mod;
		}
	}
	scanf("%lld",&t);
	while(t--){
		scanf("%lld%lld%lld",&n,&m,&k);
		cout<<dp[n][m]*k%mod<<endl;
	}
}