#include <bits/stdc++.h>
//#pragma GCC optimize ("03")
#define FastIO ios_base::sync_with_stdio(false) , cin.tie(0) , cout.tie(0)
#define FILES freopen("stirling.in" , "r" , stdin) , freopen("stirling.out" , "w" , stdout)
#define ll long long
#define ull unsigned long long
#define ld long double
#define eb emplace_back
#define pb push_back
#define qwerty1 first
#define qwerty2 second
#define qwerty3 -> first
#define qwerty4 -> second
#define umap unordered_map
#define uset unordered_set
#define pii pair < int , int >
#define pq priority_queue
#define dbg(x) cerr << #x << ": " << x << '\n'

namespace FastRead
{
    char buff[5000];int lg = 0 , p = 0;
    char nc()
    {
        if(lg == p){lg = fread(buff , 1 , 5000 , stdin);p = 0;if(!lg) return EOF;}
        return buff[p++];
    }
    template<class T>void read(T&x)
    {
        T sgn = 1; char c;while(!isdigit(c = nc()))if(c == '-')sgn = -1;
        x = c - '0';while(isdigit(c = nc()))x = x * 10 + c - '0';x *= sgn;
    }
}

using namespace FastRead;
using namespace std;

const int N = 205;
const int M = 98999;
const ld PI = acos(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int x , n , m;
int s[N][N] , S[N][N];

void Test()
{
    cin >> x >> n >> m;

    if(x == 1)
        cout << ( (n - m) % 2 ? -1 : 1 ) * s[n][m] << '\n';
    else cout << S[n][m] << '\n';
}

void prec()
{
    s[0][0] = S[0][0] = 1;

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

signed main()
{
	#ifndef ONLINE_JUDGE
		FastIO , FILES;
	#endif

    prec();

	int q; cin >> q;
	while(q--) Test();

    return 0;
}