#include <fstream>
#define int long long

using namespace std;

ifstream cin ("stirling.in");
ofstream cout ("stirling.out");

const int MOD = 98999;
const int N = 200;
int dp[2][N + 1][N + 1];

int t, cer, n, m;

void stirling ()
{
    dp[0][0][0] = dp[1][0][0] = 1;
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= N; ++j)
            dp[1][i][j] = (j * dp[1][i - 1][j] % MOD + dp[1][i - 1][j - 1]) % MOD, dp[0][i][j] = (dp[0][i - 1][j - 1] - (i - 1) * dp[0][i - 1][j]) % MOD;
}

signed main()
{
    stirling();
    for (cin >> t; t && cin >> cer >> n >> m; --t)cout << dp[cer - 1][n][m] << '\n';
    return 0;
}