Chef and Strings

Read problem statements in Mandarin Chinese.

Having already mastered cooking, Chef has now decided to learn how to play the guitar. Often while trying to play a song, Chef has to skip several strings to reach the string he has to pluck. Eg. he may have to pluck the 1st${\mathrm{}}^{}$ string and then the 6th${\mathrm{}}^{}$ string. This is easy in guitars with only 6$\mathrm{}$ strings; However, Chef is playing a guitar with 106${\mathrm{}}^{\mathrm{}}$ strings. In order to simplify his task, Chef wants you to write a program that will tell him the total number of strings he has to skip while playing his favourite song.

This is how guitar strings are numbered (In ascending order from right to left). Eg. to switch from string 1$\mathrm{}$ to 6$\mathrm{}$, Chef would have to skip 4$\mathrm{}$ strings (2,3,4,5)$\mathrm{}\mathrm{}\mathrm{}\mathrm{}$. 

Input:

• First line will contain T$$, number of testcases. Then the testcases follow. 
• The first line of each test case contains N$$, the number of times Chef has to pluck a string
• The second line of each test case contains N$$ space separated integers - S1${}_{\mathrm{}}$, S2${}_{\mathrm{}}$, …, SN${}_{}$, where Si${}_{}$ is the number of the ith${}^{}$ string Chef has to pluck.

Output:

For each testcase, output the total number of strings Chef has to skip over while playing his favourite song. 

Constraints

• 1≤T≤10$\mathrm{}\mathrm{}$
• 2≤N≤105$\mathrm{}{\mathrm{}}^{\mathrm{}}$
• 1≤Si≤106$\mathrm{}{}_{}{\mathrm{}}^{\mathrm{}}$
• For each valid i$$, Si≠Si+1${}_{}{}_{\mathrm{}}$

Subtasks

• 30 points : for each valid i$$, Si<Si+1${}_{}{}_{\mathrm{}}$
• 70 points : No additional constraints

Sample Input:

2
6
1 6 11 6 10 11
4
1 3 5 7

Sample Output:

15
3

Explanation:

Test Case 1$\mathrm{}$

• Chef skips 4$\mathrm{}$ strings (2,3,4,5)$\mathrm{}\mathrm{}\mathrm{}\mathrm{}$ to move from 1$\mathrm{}$ to 6$\mathrm{}$
• Chef skips 4$\mathrm{}$ strings (7,8,9,10)$\mathrm{}\mathrm{}\mathrm{}\mathrm{}$ to move from 6$\mathrm{}$ to 11$\mathrm{}$
• Chef skips 4$\mathrm{}$ strings (10,9,8,7)$\mathrm{}\mathrm{}\mathrm{}\mathrm{}$ to move from 11$\mathrm{}$ to 6$\mathrm{}$
• Chef skips 3$\mathrm{}$ strings (7,8,9)$\mathrm{}\mathrm{}\mathrm{}$ to move from 6$\mathrm{}$ to 10$\mathrm{}$
• Chef skips 0$\mathrm{}$ strings to move from 10$\mathrm{}$ to 11$\mathrm{}$

Therefore, the answer is 4+4+4+3+0=15$\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}$

Test Case 2$\mathrm{}$

• Chef skips 1$\mathrm{}$ string to move from 1$\mathrm{}$ to 3$\mathrm{}$
• Chef skips 1$\mathrm{}$ string to move from 3$\mathrm{}$ to 5$\mathrm{}$
• Chef skips 1$\mathrm{}$ string to move from 5$\mathrm{}$ to 7$\mathrm{}$

Therefore, the answer is 1+1+1=3