#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    const int mx = 4000;

    vector<vector<mint>> dp(mx + 1, vector<mint>(mx + 1));
    dp[0][0] = 1;
    for (int i = 1; i <= mx; i++) {
        for (int j = 1; j <= mx; j++) {
            if (i - j >= 0) {
                dp[i][j] = dp[i - 1][j - 1] + dp[i - j][j];
            } else {
                dp[i][j] = dp[i - 1][j - 1];
            }
        }
    }
    vector<vector<mint>> pref(mx + 1, vector<mint>(mx + 2));
    for (int i = 1; i <= mx; i++) {
        for (int j = 1; j <= mx; j++) {
            pref[i][j + 1] = pref[i][j] + dp[i][j];
        }
    }

    int Q;
    cin >> Q;
    while (Q--) {
        int t, N, K;
        cin >> t >> N >> K;

        cout << pref[N][K + 1].val() << '\n';
    }
}