#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
int n,a,b,c,ans,dp[210][210];
inline void solve(){
	ans=0;cin>>a>>b>>c;
	ans=(dp[a][b+c+1]+dp[b][a+c+1]+dp[c][a+b+1])%mod;
	for(int i=1;i<=a;++i)
	for(int j=1;j<=b;++j)
	for(int k=1;k<=c;++k)
	ans=(ans+dp[i][j]*dp[a-i+1][k]%mod*dp[b-j+1][c-k+1])%mod;
	cout<<ans<<"\n";
}
signed main(){
	//// freopen("triangle.in","r",stdin);
	//// freopen("triangle.out","w",stdout);
	for(int i=0;i<=201;++i)dp[i][1]=dp[1][i]=1;
	for(int i=2;i<=201;++i)
	for(int j=2;j<=201;++j)
	dp[i][j]=(dp[i][j-1]+dp[i-1][j])%mod;
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n;while(n--)solve();
	return 0;
}