#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
#define MAX 201

int T, s[MAX][MAX], S[MAX][MAX];

void Stirling() {
	for (int i = 1; i < MAX; i++) s[i][1] = 1;
	for (int i = 2; i < MAX; i++) {
		for (int j = 2; j <= i; j++) {
			s[i][j] = (s[i-1][j] + (-(i-1)) * s[i-1][j-1]) % 98999;
		}
	}
	for (int i = 0; i < MAX; i++) S[i][0] = 1;
	for (int i = 1; i < MAX; i++) {
		for (int j = 1; j <= i; j++) {
			S[i][j] = (S[i-1][j] + (1) * S[i-1][j-1]) % 98999;
		}
	}
}

int main() {
	int Op, N, M;
	
	freopen("stirling.in","r",stdin);
	freopen("stirling.out","w",stdout);
	
	Stirling();
	
	scanf("%d", &T);
	while (T--) {
		scanf("%d %d %d", &Op, &N, &M);
		if (Op == 1) {
			printf("%d\n", s[N][M]);
		} else {
			printf("%d\n", S[N][M]);
		}
	}
	
	return 0;
}