#include <bits/stdc++.h>
using namespace std;
int const m = 998244353;
int main () {
	int M[4040][4040], S[4040][4040], L[4040][4040];
	M[1][1] = S[1][1] = 1;
	M[0][0] = S[0][0] = 1;
	for (int i = 1; i < 4004;i ++) {
		M[i][1] = 1;
		S[i][1] = 1;
		for (int j = 2; j <= i; j ++) {
			M[i][j] = S[i - j][min(i - j, j)];
			S[i][j] = (S[i][j - 1] + M[i][j]) % m;
		}
	}
	int Q;
	cin >> Q;
	while (Q--) {
		int t;
		cin >> t;
		int n, k;
		cin >> n >> k;
		k = min(n, k);
		cout << S[n][k] << endl;
	}
}