#include <atcoder/all>
#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace atcoder;
using namespace std;

typedef long long ll;

using mint = modint998244353;
vector<mint> fact;

mint nPk(int n, int k) {
    bool ok = 1;
    ok &= (0 <= k && k <= n);
    ok &= (0 <= n && n < fact.size());
    if (!ok)
        return 0;
    return fact[n] / fact[n - k];
}

map<pair<int, int>, mint> memo;

mint P(int n, int k) {
    if (memo.count({n, k}))
        return memo[{n, k}];
    if (n < 0 || k < 0)
        return 0;
    if (k == 0)
        return memo[{n, k}] = (n == 0);
    return memo[{n, k}] = P(n, k - 1) + P(n - k, k);
}

void f(int n, int k) {
    mint ans = 0;
    rep(i, 0, k + 1) ans += P(n - i, i);
    cout << ans.val() << endl;
}

int main() {
    fact = vector<mint>(200010);
    fact[0] = 1;
    rep(i, 1, 200010) fact[i] = fact[i - 1] * i;
    int q;
    cin >> q;
    while (q--) {
        int t, n, k;
        cin >> t >> n >> k;
        f(n, k);
    }
}