B'You are given an array a of n integers. You must perform the following two operations on the array (the first, then the second): What is the maximum sum of the array elements after performing these two operations (the first, then the second)? The first line of the input contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. The descriptions of the test cases follow. The first line of each test case contains a single integer n ( 1 <= n <= 50 ) -- the number of elements in array a . The second line of each test case contains n integers a_1, a_2, ldots, a_n ( -100 <= a_i <= 100 ) -- elements of the array. For each test case, output the maximum sum of the array elements after sequentially performing the two given operations. In the first test case, you can first rearrange the array to get [3,-2,-3] (operation 1), then choose l = 2, r = 3 and get the sum 3 + -((-2) + (-3)) = 8 (operation 2). In the second test case, you can do nothing in both operations and get the sum 0 . In the third test case, you can do nothing in both operations and get the sum 0 + 1 = 1 . In the fourth test case, you can first leave the order unchanged (operation 1), then choose l = 1, r = 1 and get the sum -(-99) = 99 (operation 2). In the fifth test case, you can first leave the order unchanged (operation 1), then choose l = 2, r = 3 and get the sum 10 + -((-2) + (-3)) + 7 = 22 (operation 2). In the sixth test case, you can first leave the order unchanged (operation 1), then choose l = 1, r = 5 and get the sum -((-1)+(-2)+(-3)+(-4)+(-5))=15 (operation 2). '...