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.
"Codeforces Global Round 10"
"A. Omkar and Password"
# t=int(input())
# for i in range(t):
#     n=int(input())
#     a=list(map(int,input().split()))
#     m=max(a)
#     c=a.count(m)
#     if c==n:
#         print(n)
#     else:
#         print(1)    
"B. Omkar and Infinity Clock"
# t=int(input())
# for i in range(t):
#     n,k=map(int,input().split())
#     a=list(map(int,input().split()))
#     f=[0]*n
#     s=[0]*n
#     t=[0]*n
#     if k>3:
#         m=max(a)
#         for j in range(n):
#             f[j]=m-a[j]
#         m=max(f)
#         for j in range(n):
#             s[j]=m-f[j]
#         m=max(s)
#         for j in range(n):
#             t[j]=m-s[j] 
#         if k%2==0:
#             for j in s:
#                 print(j,end=" ")
#             print()
#         else:
#             for j in t:
#                 print(j,end=" ")
#             print()
#     else:
#         for qw in range(k):
#             m=max(a)
#             for j in range(n):
#                 a[j]=m-a[j]
#         for j in a:
#                 print(j,end=" ")
#         print()        
"C. Omkar and Waterslide"
t=int(input())
for qw in range(t):
    n=int(input())
    a=list(map(int,input().split()))
    c=0
    i=1
    j=0
    while i<n:
        # print(c,i,j,a[i])
        if a[i]>=a[i-1]:
            start=i
            i+=1
            # mini=a[i+1]
            # j=i+1
            # while a[j]<=m and j<n:
            #     # print(c,i,j,a[j],"j",mini)
            #     if mini>a[j]:
            #         mini=a[j]
            #     j+=1
            #     if j>n-1:
            #         break
            # i=j-1
            # c+=m-mini        
        else:
            j=i+1
            mini=a[i]
            c+=a[i-1]-mini
            while(j<n):
                if(a[j]>=a[j-1]):
                    j+=1
                else:
                    break
            i=j           
            
    print(c)        


