#include<bits/stdc++.h>

using namespace std;

const int MOD=98999;
int N,x,n,m,X[201][201];

void s(int n,int m){

    X[1][1]=1;
    for(int i=2;i<n;++i)
        for(int j=1;j<=i;++j)
            X[i][j]=(X[i-1][j-1]+(i-1)*X[i-1][j])%MOD;

}

void S(int n,int m){

    X[1][1]=1;
    for(int i=2;i<n;++i)
        for(int j=1;j<=i;++j)
            X[i][j]=(X[i-1][j-1]+j*X[i-1][j])%MOD;

}

int main()
{
    freopen("stirling.in","r",stdin);
    freopen("stirling.out","w",stdout);
    scanf("%d",&N);

    for(int i=1;i<=N;++i){
        scanf("%d%d%d",&x,&n,&m);

        if(x==1)s(n,m);
        else S(n,m);

        printf("%d\n",X[n][m]);
        memset(X,0,sizeof(X));
    }

    return 0;
}