B"Suppose you have n boxes. The i -th box contains infinitely many balls of color i . Sometimes you need to get a ball with some specific color; but you're too lazy to do it yourself. You have bought two robots to retrieve the balls for you. Now you have to program them. In order to program the robots, you have to construct two lists [a_1, a_2, ... , a_k] and [b_1, b_2, ... , b_{n-k}] , where the list a represents the boxes assigned to the first robot, and the list b represents the boxes assigned to the second robot. Every integer from 1 to n must be present in exactly one of these lists. When you request a ball with color x , the robots work as follows. Each robot looks through the boxes that were assigned to that robot, in the order they appear in the list. The first robot spends s_1 seconds analyzing the contents of a box; the second robot spends s_2 . As soon as one of the robots finds the box with balls of color x (and analyzes its contents), the search ends. The search time is the number of seconds from the beginning of the search until one of the robots finishes analyzing the contents of the x -th box. If a robot analyzes the contents of all boxes assigned to it, it stops searching. For example, suppose s_1 = 2 , s_2 = 3 , a = [4, 1, 5, 3, 7] , b = [2, 6] . If you request a ball with color 3 , the following happens: You know that you are going to request a ball of color 1 r_1 times, a ball of color 2 r_2 times, and so on. You want to construct the lists a and b for the robots in such a way that the total search time over all requests is the minimum possible. The first line contains one integer t ( 1 <= t <= 10^4 ) -- the number of test cases. Each test case consists of two lines: Additional constraint on the input: the sum of n over all test cases does not exceed 2 cdot 10^5 . For each t"...