#include <bits/stdc++.h>

using namespace std;

ifstream fin("stirling.in");
ofstream fout("stirling.out");

const int mod = 98999;

int x, n, m, s[202][202], S[202][202];

int main ()
{
  s[0][0] = S[0][0] = 1;
  for (int i = 1; i <= 200; i++)
    for (int j = 1; j <= i; j++)
      s[i][j] = (s[i - 1][j - 1] - (i - 1) * s[i - 1][j]) % mod;
  for (int i = 1; i <= 200; i++)
    for (int j = 1; j <= i; j++)
      S[i][j] = (S[i - 1][j - 1] + j * S[i][j - 1]) % mod;
  int t;
  fin >> t;
  while (t--) {
    fin >> x >> n >> m;
    if (x == 1)
      fout << s[n][m] << "\n";
    else
      fout << S[n][m] << "\n";
  }
  return 0;
}