#include <cstdio>

const int maxN = 200;
const int mod = 98999;
int dp[maxN + 1][maxN + 1][2], T;

int main() {
  freopen("stirling.in", "r", stdin);
  freopen("stirling.out", "w", stdout);
  dp[1][1][0] = dp[1][1][1] = 1;
  for(register int i = 2; i <= maxN; ++ i)
    for(register int j = 1; j <= maxN; ++ j)
      dp[i][j][0] = (dp[i - 1][j - 1][0] - (i - 1) * dp[i - 1][j][0]) % mod,
      dp[i][j][1] = (dp[i - 1][j - 1][1] + j * dp[i - 1][j][1]) % mod;
  for(scanf("%d", &T); T; -- T) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    printf("%d\n", dp[b][c][a - 1]);
  }
  return 0;
}