B'You are given an array of integers a_1, a_2, ldots, a_n . Calculate the number of subarrays of this array 1 <= q l <= q r <= q n , such that: Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. This is followed by their description. The first line of each test case contains an integer n ( 1 <= q n <= q 10^5 ) -- the size of the array a . The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= q a_i <= q 10^9 ). It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, output the number of suitable subarrays. In the first test case, there is exactly one subarray (1, 1) that suits us. In the second test case, there is exactly one subarray (1, 2) that suits us. Subarrays (1, 1) and (2, 2) do not suit us, as the subsequence [1] occurs twice in the array. In the third test case, all subarrays except (1, 1) and (3, 3) are suitable. '...