#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
int fac[3000005],ifac[3000005];
int qkp(int b,int p){
    int r=1;
    while(p){
        if(p&1)(r*=b)%=mod;
        p/=2;
        (b*=b)%=mod;
    }
    return r;
}
int C(int n,int m){
    if(n<m)return 0;
    return fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
void solve(){
    int c0,c1,c2;
    cin>>c0>>c1>>c2;
    int coef=C(c1+c2+c0-1,c1+c2-1)*fac[c0]%mod*fac[c1]%mod*fac[c2]%mod;
    //cout<<coef<<"\n";
//-1 -1 -1 1 1
//c1+c2
//x1+...+xn=c1+c2+c0
//1 1 1 1 1 1 
    //
    //1 2 4 5 
    //2 3 5 6
    //3 4 6 7
    int cnt=0;
    if(c2==c1-2||c2==c1-1||c2==c1+1||c2==c1+2){cnt++;}
    cout<<cnt*coef%mod<<"\n";
    //c1+c2 任意穿插.
    //x1+x2+...+xn=c1+c2+n.
    //C(c1+c2+n-1,n-1)
    //1 | 1|1|1
    //正整数.
    //-1 -1 1 
    //1 -1 1
}
signed main(){
    fac[0]=1;
    for(int i=1;i<=3000000;i++)fac[i]=fac[i-1]*i%mod;
    ifac[3000000]=qkp(fac[3000000],mod-2);
    for(int i=2999999;i>=0;i--){
        ifac[i]=ifac[i+1]*(i+1)%mod;
    }
    int t;
    cin>>t;
    while(t--)solve();
    return 0;
}