B'You have an array of positive integers a_1, a_2, ldots, a_n , of length n . You are also given a positive integer b . You are allowed to perform the following operations (possibly several) times in any order: However, you must also follow these rules: The cost of an array is the sum of its elements. Find the minimum cost of a you can achieve by performing these operations. Input consists of multiple test cases. The first line contains a single integer t , the number of test cases ( 1 <= t <= 5000 ). The first line of each test case contains n , b , k_1 , and k_2 ( 1 <= n <= 5000 , 1 <= b <= 10^9 , 0 <= k_1, k_2 <= n ). The second line of each test case contains n integers a_1, a_2, ldots, a_n describing the array a ( 1 <= a_i <= 10^9 ). It is guaranteed the sum of n over all test cases does not exceed 5000 . For each test case, print the minimum cost of a you can achieve by performing the operations. In the first test case, you can do the following: After these operations, the array is a = [5, 3, 3] has a cost 5 + 3 + 3 = 11 . We can show that this is the minimum achievable cost. In the second test case, note that we are not allowed to perform operation 1 more than once on a_1 . So it is optimal to apply operation 1 once to each a_1 and a_2 . Alternatively we could apply operation 1 only once to a_1 , since it has no effect on a_2 . In the third test case, here is one way to achieve a cost of 23 : After these operations, a = [2, 8, 3, 7, 3] . The cost of a is 2 + 8 + 3 + 7 + 3 = 23 . We can show that this is the minimum achievable cost. '...