#include <iostream>

#define MOD 98999
#define NMAX 201

unsigned int first_unsigned_stirling_number(unsigned int n, unsigned int k)
{
    if (n == 0 || k == 0)
        return 0;

    if (n < k)
        return 0;

    if (n == 1 && k == 1)
        return 1;

    return first_unsigned_stirling_number(n - 1, k - 1) + ((n - 1) * first_unsigned_stirling_number(n - 1, k));
}

int first_signed_stirling_number(int n, int k)
{
    if (n == 0 || k == 0)
        return 0;

    if (n < k)
        return 0;

    if (n == 1 && k == 1)
        return 1;

    return first_signed_stirling_number(n - 1, k - 1) - ((n - 1) * first_signed_stirling_number(n - 1, k));
}

unsigned int second_stirling_number(unsigned int n, unsigned int k)
{
    if (n == 0 || k == 0)
        return 0;

    if (n < k)
        return 0;

    if (n == 1 && k == 1)
        return 1;

    return second_stirling_number(n - 1, k - 1) + (k * second_stirling_number(n - 1, k));
}

int main()
{
    int t, x, n, m;
    int s[NMAX][NMAX] = {0};
    int S[NMAX][NMAX] = {0};

    freopen("stirling.in", "r", stdin);
    freopen("stirling.out", "w", stdout);

    s[1][1] = 1;

    for (int i = 2; i < NMAX; ++i)
        for (int j = 1; j <= i; ++j)
            s[i][j] = (s[i - 1][j - 1] - (i - 1) * s[i - 1][j]) % MOD;

    S[1][1] = 1;

    for (int i = 2; i < NMAX; ++i)
        for (int j = 1; j <= i; ++j)
            S[i][j] = (S[i - 1][j - 1] + j * S[i - 1][j]) % MOD;

    std::cin >> t;

    for (int i = 0; i < t; ++i) {
        std::cin >> x >> n >> m;

        switch (x) {
        case 1:
            std::cout << s[n][m] << '\n';
            break;
        case 2:
            std::cout << S[n][m] << '\n';
            break;
        default:
            break;
        }
    }

    return 0;
}