import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 10L^^9 + 7;
enum LIM = 400;

void main() {
  auto binom = new long[][](LIM, LIM);
  foreach (n; 0 .. LIM) {
    binom[n][0] = binom[n][n] = 1;
    foreach (k; 1 .. n) {
      binom[n][k] = (binom[n - 1][k - 1] + binom[n - 1][k]) % MO;
    }
  }
  
  long calc(int A, int B, int C) {
    long ret;
    foreach (x; 0 .. A) foreach (y; 0 .. A) {
      if (x + y < A) {
        long tmp = 1;
        tmp = (tmp * binom[x + B - 1][x]) % MO;
        tmp = (tmp * binom[y + C - 1][y]) % MO;
        ret += tmp;
        ret %= MO;
      }
    }
    return ret;
  }
  
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        const A = readInt();
        const B = readInt();
        const C = readInt();
        
        long ans;
        ans += calc(A, B, C);
        ans += calc(B, C, A);
        ans += calc(C, A, B);
        ans %= MO;
        foreach (a; 0 .. A) foreach (b; 0 .. B) foreach (c; 0 .. C) {
          long tmp = 1;
          tmp = (tmp * binom[(A - 1 - a) + b][b]) % MO;
          tmp = (tmp * binom[(B - 1 - b) + c][c]) % MO;
          tmp = (tmp * binom[(C - 1 - c) + a][a]) % MO;
          debug {
            writeln("a = ", a, ", b = ", b, ", c = ", c, ": ", tmp);
          }
          ans += tmp;
          ans %= MO;
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}