#include <cstdio>

const int MAXN = 2e2;
#define MOD 98999

int s[MAXN + 1][MAXN + 1], S[MAXN + 1][MAXN + 1];

int main() {
  int t, sp, n, m;
  FILE *fin = fopen("stirling.in", "r");
  fscanf(fin, "%d", &t);
  s[0][0] = S[0][0] = 1;
  for (int i = 1; i <= MAXN; ++i) {
    for (int j = 1; j <= i; ++j) {
      s[i][j] = (s[i - 1][j - 1] - (i - 1) * s[i - 1][j]) % MOD;
      S[i][j] = (S[i - 1][j - 1] + j * S[i - 1][j]) % MOD;
    }
  }
  FILE *fout = fopen("stirling.out", "w");
  for (; t > 0; --t) {
    fscanf(fin, "%d%d%d", &sp, &n, &m);
    fprintf(fout, "%d\n", sp == 1 ? s[n][m] : S[n][m]);
  }
  fclose(fin);
  fclose(fout);
  return 0;
}