m = 3000
mod = 998244353
dp = [[0] * (m+1) for _ in range(m+1)]
dp[1][1] = 1
for i in range(1, m):
    for j in range(1, i+1):
        if i+j <= m:
            dp[i+j][j] += dp[i][j]
            if dp[i+j][j] >= mod: dp[i+j][j] -= mod
        if i+1 <= m:
            dp[i+1][j+1] += dp[i][j]
            if dp[i+1][j+1] >= mod: dp[i+1][j+1] -= mod

for i in range(1, m+1):
    for j in range(1, m):
        dp[i][j+1] += dp[i][j]
        if dp[i][j+1] >= mod: dp[i][j] -= mod

q = int(input())
for _ in range(q):
    _, n, k = map(int, input().split())
    print(dp[n][k])