#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	const int m = 4000;
	vector dp(m + 1, vector<mint>(m + 1));
	rep(i, m + 1)dp[0][i] = 1;
	rep(i, m + 1) rep2(j, 1, m + 1) {
		mint val = 0;
		if (i >= j)val += dp[i - j][j];
		dp[i][j] = dp[i][j - 1] + val;
	}
	int q; cin >> q;
	while (q--) {
		int t, n, k; cin >> t >> n >> k;
		cout << dp[n][k].val() << endl;
	}
	return 0;
}