#include <bits/stdc++.h>
#define mod 98999
#define ll long long
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int t;
ll s[201][201],S[201][201];
int main()
{
    fin>>t;
    s[0][0]=S[0][0]=1;
    for(int i=1;i<=200;i++)
        for(int j=1;j<=200;j++)
        {
            s[i][j]=(s[i-1][j-1]-((i-1)*s[i-1][j])%mod)%mod;
            S[i][j]=(S[i-1][j-1]+(j*S[i-1][j])%mod)%mod;
        }
    while(t)
    {
        int caz,x,y;
        t--;
        fin>>caz>>x>>y;
        if(caz==1)
            fout<<s[x][y];
        else
            fout<<S[x][y];
        fout<<'\n';
    }
    return 0;
}