#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "stirling.in";
const char outfile[] = "stirling.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 205;
const int MOD = 98999;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

int StirlingI[MAXN][MAXN];
int StirlingII[MAXN][MAXN];

inline void buildStirlingII() {
    /// s[i][j] = s[i - 1][j - 1] + s[i - 1][j] * j  (al i-lea elemnet poate fi pus in oricare clasa
    StirlingII[1][1] = 1;
    for(int i = 2 ; i < MAXN ; ++ i)
        for(int j = 1 ; j <= i ; ++ j)
            StirlingII[i][j] = (StirlingII[i - 1][j - 1] + j * StirlingII[i - 1][j]) % MOD;
}

inline void buildStirlingI() {
    /// s[i][j] = s[i - 1][j - 1] + s[i - 1][j] * j  (al i-lea elemnet poate fi pus in oricare clasa
    StirlingI[1][1] = 1;
    for(int i = 2 ; i < MAXN ; ++ i)
        for(int j = 1 ; j <= i ; ++ j)
            StirlingI[i][j] = (StirlingI[i - 1][j - 1] - (i - 1) * StirlingI[i - 1][j]) % MOD;
}

int main() {
    buildStirlingI();
    buildStirlingII();
    int T;
    for(fin >> T ; T -- ; ) {
        int speta, N, K;
        fin >> speta >> N >> K;
        if(speta == 1)
            fout << StirlingI[N][K] << '\n';
        if(speta == 2)
            fout << StirlingII[N][K] << '\n';
    }
    fin.close();
    fout.close();
    return 0;
}