B"So the Beautiful Regional Contest (BeRC) has come to an end! n students took part in the contest. The final standings are already known: the participant in the i -th place solved p_i problems. Since the participants are primarily sorted by the number of solved problems, then p_1 ge p_2 ge ... ge p_n . Help the jury distribute the gold, silver and bronze medals. Let their numbers be g , s and b , respectively. Here is a list of requirements from the rules, which all must be satisfied: The jury wants to reward with medals the total maximal number participants (i.e. to maximize g+s+b ) so that all of the items listed above are fulfilled. Help the jury find such a way to award medals. The first line of the input contains an integer t ( 1 <= t <= 10000 ) -- the number of test cases in the input. Then t test cases follow. The first line of a test case contains an integer n ( 1 <= n <= 4 cdot10^5 ) -- the number of BeRC participants. The second line of a test case contains integers p_1, p_2, ... , p_n ( 0 <= p_i <= 10^6 ), where p_i is equal to the number of problems solved by the i -th participant from the final standings. The values p_i are sorted in non-increasing order, i.e. p_1 ge p_2 ge ... ge p_n . The sum of n over all test cases in the input does not exceed 4 cdot10^5 . Print t lines, the j -th line should contain the answer to the j -th test case. The answer consists of three non-negative integers g, s, b . In the first test case, it is possible to reward 1 gold, 2 silver and 3 bronze medals. In this case, the participant solved 5 tasks will be rewarded with the gold medal, participants solved 4 tasks will be rewarded with silver medals, participants solved 2 or 3 tasks will be rewarded with bronze medals. Participants solved exactly 1 task won't be rewarde"...