B"You are developing a rating system for an online game. Every time a player participates in a match, the player's rating changes depending on the results. Initially, the player's rating is 0 . There are n matches; after the i -th match, the rating change is equal to a_i (the rating increases by a_i if a_i is positive, or decreases by |a_i| if it's negative. There are no zeros in the sequence a ). The system has an additional rule: for a fixed integer k , if a player's rating has reached the value k , it will never fall below it. Formally, if a player's rating at least k , and a rating change would make it less than k , then the rating will decrease to exactly k . Your task is to determine the value k in such a way that the player's rating after all n matches is the maximum possible (among all integer values of k ). If there are multiple possible answers, you can print any of them. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The first line of each test case contains a single integer n ( 1 <= n <= 3 cdot 10^5 ) -- the number of matches. The second line contains n integer a_1, a_2, ... , a_n ( -10^9 <= a_i <= 10^9 ; a_i ne 0 ) -- the rating change after the i -th match. The sum of n over all test cases doesn't exceed 3 cdot 10^5 . For each test case, print one integer m ( -10^{18} <= m <= 10^{18} ) -- the value of k such that the rating of the player will be the maximum possible when using this value. It can be shown that at least one of the optimal answers meets the constraint -10^{18} <= m <= 10^{18} . In the first example, if k=3 , then the rating changes as follows: 0 rightarrow 3 rightarrow 3 rightarrow 4 rightarrow 6 . In the second example, if k=0 , then the rating changes as follows: 0 rightarrow 0 "...