#include "bits/stdc++.h"
using namespace std;
using ld= long double;


const int mod = 1000000007;
struct Mod {
public:
	int num;
	Mod() : Mod(0) { ; }
	Mod(long long int n) : num((n % mod + mod) % mod) {
		static_assert(mod<INT_MAX / 2, "mod is too big, please make num 'long long int' from 'int'");
	}
	Mod(int n) : Mod(static_cast<long long int>(n)) { ; }
	operator int() { return num; }
};

Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }
Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }
Mod operator+(const Mod a, const long long int  b) { return b + a; }
Mod operator++(Mod &a) { return a + Mod(1); }
Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }
Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }
Mod operator--(Mod &a) { return a - Mod(1); }
Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }
Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }
Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }
Mod operator*(const Mod a, const int b) { return Mod(b)*a; }
Mod operator+=(Mod &a, const Mod b) { return a = a + b; }
Mod operator+=(long long int &a, const Mod b) { return a = a + b; }
Mod operator-=(Mod &a, const Mod b) { return a = a - b; }
Mod operator-=(long long int &a, const Mod b) { return a = a - b; }
Mod operator*=(Mod &a, const Mod b) { return a = a * b; }
Mod operator*=(long long int &a, const Mod b) { return a = a * b; }
Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }
Mod operator^(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = (a * a) ^ (n / 2);
	if (n % 2) res = res * a;
	return res;
}
Mod mod_pow(const Mod a, const long long  int n) {
	if (n == 0) return Mod(1);
	Mod res = mod_pow((a * a), (n / 2));
	if (n % 2) res = res * a;
	return res;
}
Mod inv(const Mod a) { return a ^ (mod - 2); }
Mod operator/(const Mod a, const Mod b) {
	assert(b.num != 0);
	return a * inv(b);
}
Mod operator/(const long long int a, const Mod b) {
	return Mod(a) / b;
}
Mod operator/=(Mod &a, const Mod b) {
	return a = a / b;
}

#define MAX_MOD_N 1024000

Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];
void init(const int amax = MAX_MOD_N) {
	fact[0] = Mod(1); factinv[0] = 1;
	for (int i = 0; i < amax - 1; ++i) {
		fact[i + 1] = fact[i] * Mod(i + 1);
		factinv[i + 1] = factinv[i] / Mod(i + 1);
	}
}
Mod comb(const int a, const int b) {
	return fact[a] * factinv[b] * factinv[a - b];
}
map<vector<int>, Mod>memo;
Mod solve(const vector<int>&v) {
	if (memo.find(v) != memo.end())return memo[v];
	if (v == vector<int>{ 1, 1, 1 })return memo[v] = Mod(1);
	Mod ans = 0;
	for (int e1 = 0; e1 < v.size(); ++e1) {
		for (int x1 = 0; x1 < v[e1]; ++x1) {
			for (int e2plus = 1; e2plus < v.size(); ++e2plus) {
				int e2 = (e1 + e2plus) % v.size();
				for (int x2 = 0; x2 < v[e2]; ++x2) {
					if (e2plus == 1 && x2 == 0)continue;
					if (x1 == 0 && e2plus == v.size() - 1)continue;

					{
						vector<int>av,bv;
						{
							for (int npluse = 0; npluse <= e2plus; ++npluse) {
								if (npluse == 0) {
									av.emplace_back(v[e1] - x1);
								}
								else if (npluse == e2plus) {
									av.emplace_back(x2);
								}
								else {
									av.emplace_back(v[(e1 + npluse) % v.size()]);
								}
							}
							av.emplace_back(1);
						}
						
						{
							for (int npluse = 0; npluse <= v.size()-e2plus; ++npluse) {
								if (npluse == 0) {
									bv.emplace_back(v[e2]-x2);
								}
								else if (npluse == v.size() - e2plus) {
									bv.emplace_back(x1);
								}
								else {
									bv.emplace_back(v[(e2 + npluse) % v.size()]);
								}
							}
							bv.emplace_back(1);
						}
						
						av.erase(remove_if(av.begin(), av.end(), [](const int x) {return x == 0; }),av.end()); 
						bv.erase(remove_if(bv.begin(), bv.end(), [](const int x) {return x == 0; }), bv.end());

						ans += solve(av)*solve(bv);
					}
				}
			}
		}
	}
	return memo[v] = ans / Mod(accumulate(v.begin(), v.end(), -3))/Mod(2);
}
int main() {
	int N; cin >> N;
	for (int i = 0; i < N; ++i) {
		int a, b, c; cin >> a >> b >> c;
		vector<int>v{ a + 1,b + 1,c + 1 };
		Mod ans = solve(v);
		cout << ans << endl;
	}
	return 0;
}