#include namespace { #pragma GCC diagnostic ignored "-Wunused-function" #include #pragma GCC diagnostic warning "-Wunused-function" using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; using mint = modint998244353; constexpr int FACT_SIZE = 2100000; mint Fact[FACT_SIZE + 1]; mint iFact[FACT_SIZE + 1]; const auto fact_init = [] { Fact[0] = mint::raw(1); for(int i = 1; i <= FACT_SIZE; ++i) { Fact[i] = Fact[i-1] * i; } iFact[FACT_SIZE] = Fact[FACT_SIZE].inv(); for(int i = FACT_SIZE; i; --i) { iFact[i-1] = iFact[i] * i; } return false; }(); mint comb(int n, int k) { if (k == 0) return mint::raw(1); assert(n >= 0 && k >= 0); if (k > n) return mint::raw(0); return Fact[n] * iFact[n - k] * iFact[k]; } mint icomb(int n, int k) { return iFact[n] * Fact[n - k] * Fact[k]; } mint fact(int n) {return Fact[n];} mint perm(int n, int k) { assert(0 <= n); return Fact[n] * iFact[n - k]; } } int main() { ios::sync_with_stdio(false); cin.tie(0); int tt; cin >> tt; while (tt--) { int n, k, l; cin >> n >> k >> l; if (k + l - 1 > n) { cout << 0 << '\n'; continue; } mint ans; if (k + l <= n) { // [x^n] x/1-x 1/(1-x)^2(l+k-1) x^(l+k-1) // [x^(n-l-k)] 1/(1-x)^(2l+2k-1) ans += 2 * n * comb(l-1+k-1, l-1) * comb(2*(l+k-1)+n-l-k, n-l-k); } // [x^n] 1/(1-x)^2(l+k-1) x^(l+k-1) // [x^(n-(l+k-1)] 1/(1-x)^2(l+k-1) ans += n * comb(l-1+k-1, l-1) * comb(2*(l+k-1)-1+n-(l+k-1), n-(l+k-1)); cout << ans.val() << '\n'; } }