C. Search in Parallel
constructive algorithms; greedy; sortings
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, \dots, a_k]\) and \([b_1, b_2, \dots, 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: initially, the first robot starts analyzing the box \(4\), and the second robot starts analyzing the box \(2\); at the end of the \(2\)-nd second, the first robot finishes analyzing the box \(4\). It is not the box you need, so the robot continues with the box \(1\); at the end of the \(3\)-rd second, the second robot finishes analyzing the box \(2\). It is not the box you need, so the robot continues with the box \(6\); at the end of the \(4\)-th second, the first robot finishes analyzing the box \(1\). It is not the box you need, so the robot continues with the box \(5\); at the end of the \(6\)-th second, the first robot finishes analyzing the box \(5\). It is not the box you need, so the robot continues with the box \(3\). At the same time, the second robot finishes analyzing the box \(6\). It is not the box you need, and the second robot has analyzed all the boxes in its list, so that robot stops searching; at the end of the \(8\)-th second, the first robot finishes analyzing the box \(3\). It is the box you need, so the search ends; so, the search time is \(8\) seconds. 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 \le t \le 10^4\)) — the number of test cases.Each test case consists of two lines: the first line contains three integers \(n\), \(s_1\), \(s_2\) (\(2 \le n \le 2 \cdot 10^5\); \(1 \le s_1, s_2 \le 10\)); the second line contains \(n\) integers \(r_1, r_2, \dots, r_n\) (\(1 \le r_i \le 10^6\)). Additional constraint on the input: the sum of \(n\) over all test cases does not exceed \(2 \cdot 10^5\).
For each test case, print two lines. The first line should contain the list \(a\), the second line — the list \(b\). Each list has to be printed as follows: first, print the number of elements in it, and then the elements themselves.If there are multiple answers, you may print any of them.