B'There are n candies in a row, they are numbered from left to right from 1 to n . The size of the i -th candy is a_i . Alice and Bob play an interesting and tasty game: they eat candy. Alice will eat candy from left to right, and Bob -- from right to left. The game ends if all the candies are eaten. The process consists of moves. During a move, the player eats one or more sweets from her/his side (Alice eats from the left, Bob -- from the right). Alice makes the first move. During the first move, she will eat 1 candy (its size is a_1 ). Then, each successive move the players alternate -- that is, Bob makes the second move, then Alice, then again Bob and so on. On each move, a player counts the total size of candies eaten during the current move. Once this number becomes strictly greater than the total size of candies eaten by the other player on their previous move, the current player stops eating and the move ends. In other words, on a move, a player eats the smallest possible number of candies such that the sum of the sizes of candies eaten on this move is strictly greater than the sum of the sizes of candies that the other player ate on the previous move. If there are not enough candies to make a move this way, then the player eats up all the remaining candies and the game ends. For example, if n=11 and a=[3,1,4,1,5,9,2,6,5,3,5] , then: Print the number of moves in the game and two numbers: The first line contains an integer t ( 1 <= t <= 5000 ) -- the number of test cases in the input. The following are descriptions of the t test cases. Each test case consists of two lines. The first line contains an integer n ( 1 <= n <= 1000 ) -- the number of candies. The second line contains a sequence of integers a_1, a_2, ... , a_n ( 1 <= a_i <= 1000 ) -- the sizes of candies in the order they are arranged from left to right. It is guaranteed that the sum of the value'...