#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;
constexpr int MX = 4005;
mint M[MX][MX], L[MX][MX];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  {
    mint dp[MX];
    dp[0] = 1;
    
    for (int k = 1; k < MX; k++) {
      rep(i, MX - k) dp[i+k] += dp[i];
      rep(i, MX) M[i][k] = dp[i];
    }
  }
  {
    L[0][0] = 1;
    rep(i, MX) rep(j, MX) {
      if (i) L[i][j] += L[i-1][j];
      if (j - i >= 0) L[i][j] += L[i][j-i];
    }
  }
  int q;
  cin >> q;
  while (q--) {
    int type, n, k;
    cin >> type >> n >> k;
    cout << (type ? M : L)[n][k].val() << '\n';
  }
}