Given 3 positive integers **K, L ,N** where ```K <= L <= N```\nA integer set **T** of size **L** is called good if all integers in **T** are dstinct and lie in range ```[1, N]```\nLet **S** be the set of all such possible sets **T** of given length **L**.\n\nLet **A** be the uniformly and randomly chosen set from **S**. **J(A)** be the **Kth** smallest integer in this set A. Find sum of **J(A)** modulo **998244353** over all such good sets **A**.\n\nSolve this for **Q** such query.\nInput is given in form of 3 arrays **Ks, Ls, Ns** each size of **Q**.\nith query consists of ```K = ks[i], L = ls[i], N = ns[i]```.\n\nConstraints:\n* ```1 <= Q <= 10^3```\n* ```1 <= K <= L <= N <= 10^6```\n\n\n**Sample Input:**\n\t```ks: [2, 1, 2, 3]```\n\t```ls: [2, 1, 2, 3]```\n\t```ns: [3, 1, 2, 3]```\n\t\t  \n**Output:**\n```[5, 1, 2, 3]```\n\n\n- I was struggling to understand what the question is asking me to do.

Given 3 positive integers K, L ,N where K <= L <= N\nA integer set T of size L is called good if all integers in T are dstinct and lie in range [1, N]\nLet S be