def memoize(f):
  cache = {}
  def helper(*args):
    if args not in cache:
      cache[args] = f(*args)
    return cache[args]
  return helper

def solve():
  mod = 10 ** 9 + 7

  def calc(a, b, c):
    ret = binom[a + b + c - 1][b - 1]
    ret += rec2(a - 1, b, c - 1)
    return ret

  @memoize
  def rec2(a, b, c):
    ret = binom[a + b + c][b - 1]
    ret += binom[b + c][b] if a == 0 else rec2(a - 1, b, c)
    ret += binom[a + b][a] if c == 0 else rec2(a, b, c - 1)
    return ret

  N = 333
  binom = [[1]]
  prev = binom[-1]
  for i in range(1, N + 1):
    curr = [1] * (i + 1)
    for j in range(1, i):
      curr[j] = prev[j - 1] + prev[j]
    binom += [curr]
    prev = curr

  T = int(raw_input())
  for _ in range(T):
    a, b, c = map(int, raw_input().split())
    print(calc(a, b, c) % (10 ** 9 + 7))

solve()