Minimum Number Of Moves

chief has his own restaurant in the city. There are N workers there. Each worker has his own salary. The salary of the i-th worker equals to Wi (i = 1, 2, ..., N). Once, chief decided to equalize all workers, that is, he wants to make salaries of all workers to be equal. But for this goal he can use only one operation: choose some worker and increase by 1 salary of each worker, except the salary of the chosen worker. In other words, the chosen worker is the loser, who will be the only worker, whose salary will be not increased during this particular operation. But loser-worker can be different for different operations, of course. Chief can use this operation as many times as he wants. But he is a busy man. That's why he wants to minimize the total number of operations needed to equalize all workers. Your task is to find this number.
        
       Input:-2
3
1 2 3
2
42 42
       Input Description: The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains a single integer N denoting the number of workers. The second line contains N space-separated integers W1, W2, ..., WN denoting the salaries of the workers. 
       Output: 3
0
       Output Description: For each test case, output a single line containing the minimum number of operations needed to equalize all workers. 
       Constraints: 1 <= T <= 100
1 <= N <= 100
0 <= Wi <= 10000 (104)
       Explanation: Example Case 1. Chief can equalize all salaries in 3 turns by selecting number 3 twice and number 2 once.

Example Case 2. All salaries are already equal. He doesn't need to do anything.