B'Theofanis easily gets obsessed with problems before going to sleep and often has nightmares about them. To deal with his obsession he visited his doctor, Dr. Emix. In his latest nightmare, he has an array a of size n and wants to divide it into non-empty subarrays ^{ dagger} such that every element is in exactly one of the subarrays. For example, the array [1,-3,7,-6,2,5] can be divided to [1] [-3,7] [-6,2] [5] . The Cypriot value of such division is equal to Sigma_{i=1}^{k} i cdot mathrm{sum}_i where k is the number of subarrays that we divided the array into and mathrm{sum}_i is the sum of the i -th subarray. The Cypriot value of this division of the array [1] [-3,7] [-6,2] [5] = 1 cdot 1 + 2 cdot (-3 + 7) + 3 cdot (-6 + 2) + 4 cdot 5 = 17 . Theofanis is wondering what is the maximum Cypriot value of any division of the array. ^{ dagger} An array b is a subarray of an array a if b can be obtained from a by deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end. In particular, an array is a subarray of itself. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. Each test case consists of two lines. The first line of each test case contains a single integer n ( 1 <= n <= 10^{5} ) -- the size of the array. The second line contains n integers a_1, a_2, ldots, a_n ( -10^8 <= a_i <= 10^{8} ) -- the elements of the array. It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^{5} . For each test case, print one integer -- the maximum Cypriot value of the array a . In the first test case, to get the maximum Cypriot value we divide the array into [1][-3][7][-6][2][5] which gives us: Sigma_{i=1}^{k} i cdot mathrm{sum}_i = 1 cdot 1 + 2 cdot (-3) + 3 '...