#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000
#define MOD 1000000007

long memo[205][205];

long solve(long a, long b){
  if(a>b) swap(a,b);
  // a <= b
  if(memo[a][b] >= 0) return memo[a][b];
  if(a==0) return 0;
  else if(a==1) return 1;
  else return memo[a][b] = (solve(a-1,b) + solve(a,b-1))%MOD;
}

int main(){
  fill(memo[0], memo[205], -1);
  int n;
  cin>>n;
  rep(_,n){
    int a,b,c;
    cin>>a>>b>>c;
    long ans = 0;
    rep(i,a)rep(j,b)rep(k,c){
      ans += solve(i+1,j+1) * solve(a-i,k+1) %MOD * solve(b-j,c-k)%MOD;
    }
    ans += solve(a, b+c+1);
    ans += solve(b, a+c+1);
    ans += solve(c, a+b+1);
    cout << ans %MOD << endl;
  }

  return 0;
}