# dp[i][j] jをi以下の数字で分割する個数
def division1(n):
    dp = [[0]*(n+1) for _ in range(n+1)]
    dp[0][0] = 1
    for i in range(1, n+1):
        for j in range(n+1):
            if j-i >= 0:
                dp[i][j] = (dp[i-1][j]+dp[i][j-i])%MOD
            else:
                dp[i][j] = dp[i-1][j]
    return dp
# dp[i][j] iを長さがjの数字に分割する個数
def division2(n):
    dp = [[0]*(n+1) for _ in range(n+1)]
    dp[0][0] = 1
    for i in range(1, n+1):
        for j in range(1, n+1):
            if i-j >= 0:
                dp[i][j] = (dp[i-1][j-1]+dp[i-j][j])%MOD
            else:
                dp[i][j] = dp[i-1][j-1]
    return dp
# dp[i][j] iを長さがj以下の数字に分割する個数
def division3(n):
    dp = [[0]*(n+1) for _ in range(n+1)]
    dp[0][0] = 1
    for i in range(n+1):
        for j in range(1, n+1):
            if i-j >= 0:
                dp[i][j] = (dp[i][j-1]+dp[i-j][j])%MOD
            else:
                dp[i][j] = dp[i][j-1]
    return dp

Q = int(input())
query = [list(map(int, input().split())) for _ in range(Q)]

MOD = 998244353
dp1 = division1(4000)
dp2 = division3(4000)
for type, n, k in query:
    if type == 1:
        print(dp1[k][n])
    else:
        print(dp2[n][k])