No Minimum No Maximum
All submissions for this problem are available.
Read problems statements in Mandarin chinese, Russian and Vietnamese as well.Maheshmati and Sangu are playing a game. First, Maheshmati gives Sangu a sequence of $N$ distinct integers $a_1, a_2, \dots, a_N$ (not necessarily sorted) and an integer $K$. Sangu has to create all subsequences of this sequence with length $K$. For each subsequence, he has to write down the product of $K-2$ integers: all elements of this subsequence except the minimum and maximum element. Sangu wins the game if he is able to write down all these numbers and tell Maheshmati their product (modulo $10^9+7$, since it can be very large). However, Sangu is a very lazy child and thus wants you to help him win this game. Compute the number Sangu should tell Maheshmati! ### Input - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains two space-separated integers $N$ and $K$. - The second line contains $N$ space-separated integers $a_1, a_2, \dots, a_N$. ### Output For each test case, print a single line containing one integer — the product of all numbers written down by Sangu modulo $10^9+7$. ### Constraints - $1 \le T \le 10$ - $3 \le N \le 5,000$ - $3 \le K \le N$ - $1 \le a_i \le 10,000$ for each valid $i$ - the numbers $a_1, a_2, \dots, a_N$ are pairwise distinct ### Subtasks **Subtask #1 (20 points):** $1 \le N \le 10$ **Subtask #2 (80 points):** original constraints ### Example Input ``` 1 4 3 1 2 3 4 ``` ### Example Output ``` 36 ``` ### Explanation **Example case 1:** There are four possible subsequences: - $[1, 2, 3]$ (Sangu should write down $2$.) - $[1, 3, 4]$ (Sangu should write down $3$.) - $[1, 2, 4]$ (Sangu should write down $2$.) - $[2, 3, 4]$ (Sangu should write down $3$.) The required product is $2 \cdot 3 \cdot 2 \cdot 3 = 36$.
|Tags||easy, july18, shubhscoder|
|Time Limit:||2 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.