#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    int N = 4010;
    int mod = 998244353;
    vector<vector<int>> dp(N+1,vector<int>(N+1));
    dp[0][0] = 1;
    for(int i=0;i<N;i++){
    	dp[i+1] = dp[i];
    	for(int k=i+1;k<=N;k++) dp[i+1][k] = (dp[i+1][k]+dp[i+1][k-(i+1)])%mod;
    }
    int Q;
    cin>>Q;
    while(Q--){
    	int a,b,c;
    	cin>>a>>b>>c;
    	cout<<dp[c][b]<<endl;
    }
}