#include <cstdio>
#include <algorithm>
using namespace std;
struct numere
{
    int c;
    int x;
    int y;
};
numere a[1002];
int MAX,nr,n,s1[220][220],s2[220][220],i,j;
int main()
{
    freopen("stirling.in","r",stdin);
    freopen("stirling.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n;i++)
    {
        scanf("%d%d%d",&a[i].c,&a[i].x,&a[i].y);
        if (a[i].x>MAX) MAX=a[i].x;
    }
    s1[1][1]=1;
    s2[1][1]=1;
    for (i=2;i<=MAX;i++)
        for (j=1;j<=i;j++)
        {
            s1[i][j]=(s1[i-1][j-1]-(i-1)*s1[i-1][j])%98999;
            s2[i][j]=(s2[i-1][j-1]+j*s2[i-1][j])%98999;
        }
    for (i=1;i<=n;i++)
        if (a[i].c==1) printf("%d\n",s1[a[i].x][a[i].y]);
        else printf("%d\n",s2[a[i].x][a[i].y]);
    return 0;
}