#include <cstdio>

using namespace std;

const int M=202;
int t, x, a, b, s[M][M], S[M][M];

void unu()
{
    s[1][1]=1;
    for (int n=2; n<=200; ++n)
        for (int m=1; m<=200; ++m)
            s[n][m]=(s[n-1][m-1]-(n-1)*s[n-1][m])%98999;
}

void doi()
{
    S[1][1]=1;
    for (int n=2; n<=200; ++n)
        for (int m=1; m<=200; ++m)
            S[n][m]=(S[n-1][m-1]+m*S[n-1][m])%98999;
}

int main()
{
    freopen ("stirling.in","r",stdin);
    freopen ("stirling.out","w",stdout);
    scanf ("%d ",&t);
    unu();
    doi();
    while (t--)
    {
        scanf ("%d %d %d ",&x,&a,&b);
        if (x==1)
            printf ("%d\n",s[a][b]);
        else printf ("%d\n",S[a][b]);
    }
    return 0;
}