#include<bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}



const int mod = MOD;
const int max_n = 200005;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  bool operator==(const mint &p) const { return x == p.x; }
  bool operator!=(const mint &p) const { return x != p.x; }
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
using vm=vector<mint>;
using vvm=vector<vm>;
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
}comb(max_n);

void solve(){
  ll a,b,c;cin >> a >> b >> c;
  mint ans=0;
  vvm dp(110,vm(110));dp[1][1]=1;
  for(ll i=1;i<=a+1;i++){
    for(ll j=1;j<=b+1;j++){
      //cout << i <<" " << j << endl;
      if(i!=a+1&&j!=b+1){
        for(ll k=1;k<=c;k++){
          ans+=dp[i][j]*comb(a+1-i-1+k-1,k-1)*comb(b+1-j-1+c+1-k-1,c+1-k-1);
          //cout << comb(a+1-i-1+k-1,k-1)*comb(b+1-j-1+c+1-k-1,c+1-k-1) << endl;
          //cout << comb(a+1-i-1+k-1,k-1) <<" " << comb(b+1-j-1+c+1-k-1,c+1-k-1) << endl;
        }
      }
      else if(i==a+1&&j==b+1)continue;
      else if(i==a+1){
        ans+=dp[i][j]*comb(b+1-j-1+c-1,c-1);
      }
      else if(j==b+1){
        ans+=dp[i][j]*comb(a+1-i-1+c-1,c-1);
      }
      dp[i+1][j]+=dp[i][j];
      dp[i][j+1]+=dp[i][j];
      //cout << i <<" " << j <<" " << ans << endl;
    }
  }
  for(ll k=1;k<=c;k++){
    for(ll l=k;l<=c;l++){
      ans+=comb(k+a-2,a-1)*comb(c+1-l+b-2,b-1);
    }
  }
  /*rep(i,a+2){
    rep(j,b+2){
      cout << dp[i][j] <<" ";
    }
    cout << endl;
  }*/
  //ans+=dp[a+1][b+1];
  cout << ans << endl;
}
int main(){
  ll t;cin >> t;
  while(t--){
    solve();
  }
}