MOD = 1000000007

N = 50005
s = [[0] * 205 for _ in range(N+1)]       # 第一类斯特林数数组

# 算组合数
dp = [[0]*201 for _ in range(201)]
dp[0][0] = 1
dp[1][0], dp[1][1] = 1, 1
for i in range(2, 201):
    dp[i][0] = 1
    for j in range(1, i+1):
        dp[i][j] = dp[i-1][j] + dp[i-1][j-1]

# 算第一类斯特林数
fac_val = 1 # 阶乘数值
s[0][0] = 1
s[1][1] = 1
for i in range(2, N+1):
    s[i][1] = fac_val
    for j in range(2, min(i, 200)):
        s[i][j] = s[i-1][j-1] + (i-1) * s[i-1][j]
        s[i][j] %= MOD

    if i <= 200:
        s[i][i] = 1

    fac_val *= i
    fac_val %= MOD

T = int(input())
for _ in range(T):
    n, a, b = map(int, input().split())
    ans = (s[n-1][a+b-2] * dp[a+b-2][a-1]) % MOD
    print(ans)