B"The position of the leftmost maximum on the segment [l; r] of array x = [x_1, x_2, ldots, x_n] is the smallest integer i such that l <= i <= r and x_i = max(x_l, x_{l+1}, ldots, x_r) . You are given an array a = [a_1, a_2, ldots, a_n] of length n . Find the number of integer arrays b = [b_1, b_2, ldots, b_n] of length n that satisfy the following conditions: Since the answer might be very large, print its remainder modulo 10^9+7 . Each test contains multiple test cases. The first line contains a single integer t ( 1 <= t <= 10^3 ) -- the number of test cases. The first line of each test case contains two integers n and m ( 2 <= n,m <= 2 cdot 10^5 , n cdot m <= 10^6 ). The second line of each test case contains n integers a_1,a_2, ldots,a_n ( 1 <= a_i <= m ) -- the array a . It is guaranteed that the sum of n cdot m over all test cases doesn't exceed 10^6 . For each test case print one integer -- the number of arrays b that satisfy the conditions from the statement, modulo 10^9+7 . In the first test case, the following 8 arrays satisfy the conditions from the statement: In the second test case, the following 5 arrays satisfy the conditions from the statement: "...