B"LuoTianyi gave an array b of n cdot m integers. She asks you to construct a table a of size n x m , filled with these n cdot m numbers, and each element of the array must be used exactly once. Also she asked you to maximize the following value: This means that we consider n cdot m subtables with the upper left corner in (1,1) and the bottom right corner in (i, j) ( 1 <= i <= n , 1 <= j <= m ), for each such subtable calculate the difference of the maximum and minimum elements in it, then sum up all these differences. You should maximize the resulting sum. Help her find the maximal possible value, you don't need to reconstruct the table itself. Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 200 ) -- the number of test cases. The description of test cases follows. The first line of each test case contains two integers n and m ( 2 <= n, m <= 100 ) -- the number of rows and columns of the table. The second line of each test case contains n cdot m integers b_1, b_2, ldots, b_{n cdot m} ( -10^5 <= b_{i} <= 10^5 ) -- the numbers you can put in the table. Note, that integers in the array b can be negative. It is guaranteed that the sum of n cdot m over all test cases doesn't exceed 2 cdot 10^5 . For each test case, output a single integer -- the maximal value, that can be obtained. In the first test case, the table is follows: 4113 In the subtable with the bottom right corner in (1, 1) , the difference of the maximal and minimal elements is 4 - 4 = 0 . In the subtable with the bottom right corner in (1, 2) , the difference of the maximal and minimal elements is 4 - 1 = 3 . In the subtable with the bottom right corner in (2, 1) , the difference of the maximal and minimal elements is 4 - 1 = 3 . In the subtable with the bottom right corner in (2"...