// https://www.infoarena.ro/problema/stirling - didactic
#include <stdio.h>

#define MAXN 200
#define MOD 98999

typedef long long ll;

ll stirling[2][MAXN + 1][MAXN + 1];
int t;

int main() {

  for (int i = 1; i <= MAXN; i++) {
    stirling[0][i][i] = 1;
    stirling[1][i][i] = 1;
    for (int j = 1; j < i; j++) {
      stirling[0][i][j] =
          stirling[0][i - 1][j - 1] - (i - 1) * stirling[0][i - 1][j];
      stirling[1][i][j] = stirling[1][i - 1][j - 1] + j * stirling[1][i - 1][j];

      stirling[0][i][j] %= MOD;
      stirling[1][i][j] %= MOD;
    }
  }

  freopen("stirling.in", "r", stdin);
  freopen("stirling.out", "w", stdout);
  scanf("%d", &t);
  for (int i = 0; i < t; i++) {
    int c, n, m;
    scanf("%d%d%d", &c, &n, &m);
    printf("%lld\n", stirling[c - 1][n][m]);
  }
  return 0;
}