HandsOn $>$ Quick Queries

You are given an array A with $N$ distinct numbers.

You are given $Q$ queries, where each query has three numbers: I,$V,$ and $K.$

It is givenothat $f(K)$ is the sum of absolute differences for every pair if you choose K numbers from $A.$

For each query, you have to make $A_1=v^2$ for every $($:$Ij\},$ then find the value of $f(K).$ The answer to the query is this value of $f(K).$

Find the maximum possible value of Ans ${?}_1+2^{**}$ Ans ${?}_2+$dots$+Q^{**}$ Ans $($:${?}_Q\}$ modulo ${10}^9+7,$ where Ans ${?}_i$ is the value of $f(K)$ for the $i^{th}$ query.

Notes:

You don't have to choose contiguous.