Minimum Operations to Make the Sequence Strictly Increasing

You are given a sequence of N integers and an extra integer parameter K (which is provided but not used in this problem). Your task is to compute the minimum number of operations required to transform the sequence into a strictly increasing sequence.

In one operation, you can increment any element of the sequence by 1. If an element is not greater than the previous element, you must increment it enough times so that it becomes exactly one more than the previous element. Formally, for every index i (1 ≤ i < N), if sequence[i] ≤ sequence[i-1], then you need to add (sequence[i-1] − sequence[i] + 1) to sequence[i] and count these additions as operations.

The goal is to determine the total number of operations required to make the entire sequence strictly increasing.

Note: The parameter K is part of the input format but it is not used in the calculation.

Constraints:

• 1 ≤ N ≤ 10⁵
• Sequence elements and K are integers.

inputFormat

The input begins with a single integer T (number of test cases). Each test case includes:

• One line with two integers N and K, where N is the number of elements in the sequence.
• One line with N space-separated integers, representing the sequence.

For example:

5
4 2
1 2 3 2
5 3
5 5 5 5 5
3 1
1 2 3
4 4
1 1 1 1
2 2
1 1

outputFormat

For each test case, output a single integer representing the minimum number of operations needed to make the sequence strictly increasing. Each answer should be printed on a new line.

## sample

5
4 2
1 2 3 2
5 3
5 5 5 5 5
3 1
1 2 3
4 4
1 1 1 1
2 2
1 1

2
10
0
6
1

</p>