#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

ll A[101][101][101], B[102][102];
ll getA(int i, int j, int k){
  if(i > j)swap(i, j);
  if(j > k)swap(j, k);
  if(i > j)swap(i, j);
  return A[i][j][k];
}
ll getB(int i, int j){
  if(i > j)swap(i, j);
  return B[i][j];
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  FOR(i, 1, 102)B[1][i] = 1;
  FOR(i, 0, 102)B[0][i] = 1;
  FOR(i, 2, 102)FOR(j, i, 102) B[i][j] = (getB(i-1, j) + getB(i, j-1)) % mod;
  FOR(i, 1, 101)A[1][1][i] = i+2;
  ll r;
  FOR(i, 1, 101){
    FOR(j, max(i, 2), 101){
      FOR(k, j, 101){
        if(i==1){
          r = getB(j, k+1);
        }else{
          r = getA(i-1, j, k);
        }
        r += getA(i, j-1, k);
        FOR(l, 1, k+1) r += getB(i, l) * getB(j, k-l+1) % mod;
        A[i][j][k] = r % mod;
      }
    }
  }
  int n, a, b, c;
  cin >> n;
  FOR(i, 0, n){
    cin >> a >> b >> c;
    if(a > b)swap(a, b);
    if(b > c)swap(b, c);
    if(a > b)swap(a, b);
    if(a == 0){
      cout << getB(b+1, c+1) << endl;
    }else{
      ll ans = getA(a, b, c);
      FOR(i, 1, c + 1)ans += getB(a, i) * getB(b+1, c-i+1) % mod;
      cout << ans % mod << endl;
    }
  }
  return 0;
}