#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<int(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
#include <atcoder/modint>
using Modint = atcoder::static_modint<998244353>;
using namespace std;

void testcase(){
    i64 Z = 4001;
    vector<vector<Modint>> dp(Z+1);
    rep(i,Z+1) dp[i].resize(Z+1);
    dp[0][0] = 1;
    rep(i,Z){
        rep(j,Z) dp[i][j+1] += dp[i][j];
        for(i64 j=1; i+j<=Z; j++) dp[i+j][j] += dp[i][j];
    }
    i64 Q; cin >> Q;
    rep(qi,Q){
        i64 t,n,k; cin >> t >> n >> k;
        cout << dp[n][k].val() << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}