#include <fstream>
#define MOD 98999
using namespace std;
ifstream f("stirling.in");
ofstream g("stirling.out");
int first[205][205],second[205][205],X,N,M,T;
void Solve_for_all()
{
    int i,j;
    first[0][0]=second[0][0]=1;
    for(i=1;i<=200;i++)
        for(j=1;j<=200;j++)
            first[i][j]=(-(i-1)*first[i-1][j]+first[i-1][j-1])%MOD,second[i][j]=(j*second[i-1][j]+second[i-1][j-1])%MOD;
}
void Browse()
{
   f>>T;
   while(T!=0)
   {
       f>>X>>N>>M;
       if(X==1)
          g<<first[N][M]<<"\n";
       else
          g<<second[N][M]<<"\n";
       T--;
   }
}
int main()
{
    Solve_for_all();
    Browse();
    return 0;
}