Omkar is building a waterslide in his water park, and he needs your help to ensure that he does it as efficiently as possible.

Omkar currently has n supports arranged in a line, the i-th of which has height a_i. Omkar wants to build his waterslide from the right to the left, so his supports must be nondecreasing in height in order to support the waterslide. In 1 operation, Omkar can do the following: take any contiguous subsegment of supports which is nondecreasing by heights and add 1 to each of their heights. 

Help Omkar find the minimum number of operations he needs to perform to make his supports able to support his waterslide!

An array b is a subsegment of an array c if b can be obtained from c by deletion of several (possibly zero or all) elements from the beginning and several (possibly zero or all) elements from the end.

An array b_1, b_2, ..., b_n is called nondecreasing if b_i≤ b_{i+1} for every i from 1 to n-1.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 100). Description of the test cases follows.

The first line of each test case contains an integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of supports Omkar has.

The second line of each test case contains n integers a_{1},a_{2},...,a_{n} (0 ≤ a_{i} ≤ 10^9) — the heights of the supports.

It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5.

Output

For each test case, output a single integer — the minimum number of operations Omkar needs to perform to make his supports able to support his waterslide.

Example

Input


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


Output


3
2
0

Note

The subarray with which Omkar performs the operation is bolded.

In the first test case:

  * First operation:

[5, 3, 2, 5] → [5, 3, 3, 5]

  * Second operation:

[5, 3, 3, 5] → [5, 4, 4, 5]

  * Third operation:

[5, 4, 4, 5] → [5, 5, 5, 5]




In the third test case, the array is already nondecreasing, so Omkar does 0 operations.
import java.util.*;
public class OmkarAndWaterslide {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		long t=sc.nextInt();
		while(t-->0) {
			int n=sc.nextInt();
			long arr[]=new long[n];
			long min=0,ans=0,highest=0;
			for(int i=0;i<n;i++) {
				arr[i]=sc.nextLong();
			}
			for(int i=0;i<n-1;i++) {
				if(arr[i]>arr[i+1]) {
					highest=arr[i];
					//System.out.println(highest);
					min=arr[i+1];
					if(i+1==n-1) {
						ans=ans+(highest-min);
						break;
					}
					//System.out.println(i);
					//System.out.println(min);
					for(int j=i+1;j<n;j++) {
						if(j==n-1) {
							//System.out.println("YES");
							ans=ans+(highest-min);
							break;
						}
						if(arr[j]>arr[j+1]) {
							min=arr[j+1];
							//System.out.println(min);
							//System.out.println(arr[j]+"arr[j]");
							//System.out.println(arr[j+1]);
							//System.out.println(j+"j");
							//System.out.println(j+1);
							//System.out.println();
						}
						else{
							//System.out.println("NO");
							ans=ans+(highest-min);
							break;
						}
						i=j+1;
					}
				}
			}
			System.out.println(ans);
		}

	}

}
