B'Let p_1, ldots, p_n be a permutation of [1, ldots, n] . Let the q -subsequence of p be a permutation of [1, q] , whose elements are in the same relative order as in p_1, ldots, p_n . That is, we extract all elements not exceeding q together from p in the original order, and they make the q -subsequence of p . For a given array a , let pre(i) be the largest value satisfying pre(i) < i and a_{pre(i)} > a_i . If it does not exist, let pre(i) = -10^{100} . Let nxt(i) be the smallest value satisfying nxt(i) > i and a_{nxt(i)} > a_i . If it does not exist, let nxt(i) = 10^{100} . For each q such that 1 <= q q <= q n , let a_1, ldots, a_q be the q -subsequence of p . For each i such that 1 <= q i <= q q , pre(i) and nxt(i) will be calculated as defined. Then, you will be given some integer values of x , and for each of them you have to calculate sum limits_{i=1}^q min(nxt(i) - pre(i), x) . Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). The description of the test cases follows. The first line of each test case contains a single integer n ( 1 <= q n <= q 3 cdot 10^5 ) -- the length of the permutation. The second line of each test case contains n integers p_1, ldots, p_n ( 1 <= q p_i <= q n ) -- the initial permutation. Then, for each q such that 1 <= q q <= q n in ascending order, you will be given an integer k ( 0 <= q k <= q 10^5 ), representing the number of queries for the q -subsequence. Then k numbers in a line follow: each of them is the value of x for a single query ( 1 <= q x <= q q ). It is guaranteed that the sum of n over all test cases does not exceed 3 cdot 10^5 and the sum of k over all test cases does not exceed 10^5'...