#pragma GCC optimize ("03", "Ofast", "unroll-loops")
#include <bits/stdc++.h>

using namespace std;

#define INFILE "stirling.in"
#define OUTFILE "stirling.out"

typedef long long ll;

const int MOD = 98999;
const int N_MAX = 205;

ll s[N_MAX][N_MAX]; // numerele lui stirling de speta I
ll S[N_MAX][N_MAX]; // numerele lui stirling de speta II

void init(){

    s[0][0] = S[0][0] = 1;
    for(int i = 1; i < N_MAX; ++i){
        for(int j = 1; j < N_MAX; ++j){
            s[i][j] = (s[i - 1][j - 1] - ((i - 1) * s[i - 1][j] % MOD)) % MOD;
            S[i][j] = (S[i - 1][j - 1] + (j * S[i - 1][j] % MOD)) % MOD;
        }
    }

}

void solve(){

    int task, n, m; cin >> task >> n >> m;
    if(task == 1) cout << s[n][m] << '\n';
    else cout << S[n][m] << '\n';

}

int main(){
    ios_base::sync_with_stdio(false);
    freopen(INFILE, "r", stdin);
    freopen(OUTFILE, "w", stdout);
    cin.tie(0), cout.tie(0);
    init();
    int tests; cin >> tests;
    for(int i = 0; i < tests; ++i) solve();
    return 0;
}