B'Polycarp is the project manager in the IT-company. Right now, he needs to choose developers for his team to start a new project. The company has n developers "on the bench" (i.e not involved in other projects). Polycarp assessed the skills of each of them: a_i ( -10^4 <= a_i <= 10^4 ) -- an integer characteristic of the i -th developer. This value can be either positive, zero or even negative (some developers cause distractions). After Polycarp chooses a subset of developers for his team, the strength of the team will be determined by the sum of a_i values for all selected developers. Polycarp fears that if he chooses a team in such a way that maximizes the sum of the characteristics of a_i , other managers may find this unacceptable. For this reason, he plans to create such a team that the sum of the a_i values for it is strictly less than the maximum possible value. Help Polycarp choose any team that: If, following the requirements above, you can select a team in several ways, then just find any of them. It 's guaranteed that the sum of the characteristics in the desired subset is strictly positive (i.e. Polycarp can always choose a non-empty team). The first line contains one integer t ( 1 <= t <= 10^4 ) -- the number of test cases. Then t test cases follow. Each test case begins with a line containing one integer n ( 2 <= n <= 10^5 ) -- the number of developers "on the bench". The second line of a test case contains a sequence of integers a_1, a_2, ... , a_n ( -10^4 <= a_i <= 10^4 ) -- the characteristics of the n developers. It is guaranteed that the characteristics are such that the sum of the characteristics in the answer is strictly positive. It is guaranteed that the sum of n over all test cases in the input doesn 't exceed 10^5 . Print the answers for the given t test cases in the order that they appear in the input. In the first line of e'...