#include <bits/stdc++.h>
#define mod 98999

using namespace std;

ifstream fin("stirling.in");
ofstream fout("stirling.out");

int t, x, n, m;
int s1[205][205], s2[205][205];
int main(){
    s1[1][1] = 1;
    for (int i = 2; i <= 200; i++){
        for (int j = 1; j <= i; j++)
            s1[i][j] = (s1[i - 1][j - 1] - (i - 1) * s1[i - 1][j] % mod) % mod;
    }
    s2[1][1] = 1;
    for (int i = 2; i <= 200; i++)
        for (int j = 1; j <= i; j++)
            s2[i][j] = (s2[i - 1][j - 1] + j * s2[i - 1][j]) % mod;
    fin >> t;
    while (t--){
        fin >> x >> n >> m;
        if (x == 1)
            fout << s1[n][m] << "\n";
        else
            fout << s2[n][m] << "\n";
    }
    return 0;
}