Yousef has (n) columns of cubes standing side by side. The (i)-th column contains (a_i) identical unit cubes stacked vertically. Initially gravity pulls cubes downwards, so every column (i) contains exactly (a_i) cubes at heights (1, 2, \dots, a_i). Suddenly, gravity shifts to the right. Each cube slides horizontally as far to the right as possible. A cube cannot pass through or overlap other cubes, and it must remain at its original height. The final configuration is uniquely determined by the initial heights. Before the gravity shift, Yousef may perform at most one operation: choose an index (i) and decrease (a_i) by (1) (i.e. remove one cube from that column). He may also choose to do nothing. A cube's movement distance is defined as (|j - i|), where (i) is its original column index and (j) is its column index after the gravity shift. Find the maximum possible total movement distance (the sum of the movement distances of all remaining cubes) Yousef can achieve. The first line contains an integer (t) ((1 \le t \le 10^4)) — the number of test cases. The description of the test cases follows. The first line of each test case contains a single integer (n) ((1 \le n \le 2 \cdot 10^5)) — the length of the array. The second line of each test case contains (n) integers (a_1, a_2, \dots, a_n) ((1 \le a_i \le n)) — the elements of the array. It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^5). For each test case, output a single integer — the maximum possible total movement distance (the sum of the movement distances of all remaining cubes) Yousef can achieve. In the first test case, the initial total movement distance is (5). If Yousef removes the cube at index (5), the array becomes (1, 2, 3, 2, 0). Because the fifth column is now empty, all cubes from the first four columns are able to slide further to the right than they could