#include <bits/stdc++.h>
using namespace std;

const int NMAX = 256,
           MOD = 98999;

int n,x,m,t;
int S[NMAX][NMAX],
    s[NMAX][NMAX];

int main(void) {
    freopen("stirling.in",  "r", stdin);
    freopen("stirling.out", "w", stdout);

    S[0][0] = 1;
    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] + 1LL*j*S[i-1][j]) % MOD,
            s[i][j] = (s[i-1][j-1] - 1LL*(i-1)*s[i-1][j]) % MOD;

    scanf("%d",&t);
    while(t--) {
        scanf("%d%d%d",&x,&n,&m);
        if(x==1)
            printf("%d\n",s[n][m]);
        else

            printf("%d\n",S[n][m]);
    }

    fclose(stdin);
    fclose(stdout);
    return 0;
}