CF1929A.Sasha and the Beautiful Array

Sasha decided to give his girlfriend an array $a_1, a_2, \ldots, a_n$. He found out that his girlfriend evaluates the beauty of the array as the sum of the values $(a_i - a_{i - 1})$ for all integers $i$ from $2$ to $n$.

Help Sasha and tell him the maximum beauty of the array $a$ that he can obtain, if he can rearrange its elements in any way.

萨沙决定送他女朋友一个数组 $a_1, a_2, \ldots, a_n$。他发现，他女朋友将该数组的“美感”定义为所有整数 $i$ 从 $2$ 到 $n$ 对应的 $(a_i - a_{i - 1})$ 的和。

请帮助萨沙，告诉他：若可以以任意方式重排数组 $a$ 的元素，所能得到的最大美感值是多少？

Each test consists of multiple test cases. The first line contains a single integer $t$ ($1 \le t \le 500$) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a single integer $n$ ($2 \leq n \leq 100$) — the length of the array $a$.

The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \leq a_i \leq 10^9$) — the elements of the array $a$.

每个测试包含多个测试用例。第一行包含一个整数 $t$（$1 \le t \le 500$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例的第一行包含一个整数 $n$（$2 \leq n \leq 100$），表示数组 $a$ 的长度。

每个测试用例的第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$1 \leq a_i \leq 10^9$），表示数组 $a$ 的元素。

For each test case, output a single integer — the maximum beauty of the array $a$ that can be obtained.

对于每个测试用例，输出一个整数——所能得到的数组 $a$ 的最大美观度。

In the first test case, the elements of the array $a$ can be rearranged to make $a = [1, 2, 3]$. Then its beauty will be equal to $(a_2 - a_1) + (a_3 - a_2) = (2 - 1) + (3 - 2) = 2$.

In the second test case, there is no need to rearrange the elements of the array $a$. Then its beauty will be equal to $0$.

在第一个测试用例中，数组 $a$ 的元素可以重新排列为 $a = [1, 2, 3]$。此时其美观度为 $(a_2 - a_1) + (a_3 - a_2) = (2 - 1) + (3 - 2) = 2$。

在第二个测试用例中，无需重新排列数组 $a$ 的元素。此时其美观度为 $0$。