#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all> 
using mint = atcoder::modint998244353;
#define int long long
signed main() {
  int Q;
  cin >> Q;
  int m = 4000;
  vector<vector<mint>> dp(m+1,vector<mint>(m+1,0));
  dp[0][0] = 1;
  for(int i = 0; i < m; i++) {
    dp[i+1] = dp[i];
    for(int j = 0; j <= m; j++) {
      if(i+1+j <= m) dp[i+1][j+i+1]+=dp[i+1][j];
    }
  }
  while(Q--) {
    int t,n,k;
    cin >> t >> n >> k;
    if(t == 1) {
      mint ans = dp[k][n];
      cout << ans.val() << endl;
    }
    else {
      mint ans = 0;
      ans = dp[k][n];
      cout << ans.val() << endl;
    }
  }
}