#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=(x<<1)+(x<<3)+(ch&15);
		ch=getchar();
	}
	return x*f;
}
inline void write(int x)
{
	if(x<0)x=-x,putchar('-');
	if(x>9)write(x/10);
	putchar(x%10+48);
	return;
}
const int mod=1e9+7;
map<pair<int,int>,int>suibian1234; 
inline int f(int a,int b)
{
	if(a==1||b==1)return 1;
	if(suibian1234[make_pair(a,b)])return suibian1234[make_pair(a,b)];
	return suibian1234[make_pair(a,b)]=(f(a-1,b)+f(a,b-1))%mod;
}
int main()
{
	//freopen("triangle.in","r",stdin);
	//freopen("triangle.out","w",stdout);
	int T=read();
	while(T--)
	{
		int a=read(),b=read(),c=read(),ans=0;
		for(int i=1;i<=a;++i)
			for(int j=1;j<=b;++j)
				for(int k=1;k<=c;++k)
					ans=(ans+(1ll*f(i,j)%mod*f(a-i+1,k)%mod*f(b-j+1,c-k+1)%mod))%mod;
		ans=(ans+f(a,b+c+1))%mod;
		ans=(ans+f(b,a+c+1))%mod;
		ans=(ans+f(c,a+b+1))%mod;
		write(ans);puts("");
	}
    return 0;
}