B"You are given an array a_1, a_2, ... a_n . Count the number of pairs of indices 1 <= q i, j <= q n such that a_i < i < a_j < j . The first line contains an integer t ( 1 <= q t <= q 1000 ) -- the number of test cases. The first line of each test case contains an integer n ( 2 <= q n <= q 2 cdot 10^5 ) -- the length of the array. The second line of each test case contains n integers a_1, a_2, ... , a_n ( 0 <= q a_i <= q 10^9 ) -- the elements of the array. It is guaranteed that the sum of n across all test cases does not exceed 2 cdot 10^5 . For each test case, output a single integer -- the number of pairs of indices satisfying the condition in the statement. Please note, that the answer for some test cases won't fit into 32-bit integer type, so you should use at least 64-bit integer type in your programming language (like long long for C++). For the first test cases the pairs are (i, j) = {(2, 4), (2, 8), (3, 8) } . "...