B"You are given an array a of n integers and a set B of m positive integers such that 1 <= q b_i <= q lfloor frac{n}{2} rfloor for 1 <= i <= m , where b_i is the i -th element of B . You can make the following operation on a : Consider the following example, let a=[0,6,-2,1,-4,5] and B= {1,2 } : Find the maximum sum limits_{i=1}^n {a_i} you can get after applying such operation any number of times (possibly zero). The input consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 10^5 ) -- the number of test cases. Description of the test cases follows. The first line of each test case contains two integers n and m ( 2 <= q n <= q 10^6 , 1 <= q m <= q lfloor frac{n}{2} rfloor ) -- the number of elements of a and B respectively. The second line of each test case contains n integers a_1,a_2, ldots,a_n ( -10^9 <= q a_i <= q 10^9 ). The third line of each test case contains m distinct positive integers b_1,b_2, ldots,b_m ( 1 <= q b_i <= q lfloor frac{n}{2} rfloor ) -- the elements in the set B . It's guaranteed that the sum of n over all test cases does not exceed 10^6 . For each test case print a single integer -- the maximum possible sum of all a_i after applying such operation any number of times. In the first test, you can apply the operation x=1 , l=3 , r=3 , and the operation x=1 , l=5 , r=5 , then the array becomes [0, 6, 2, 1, 4, 5] . In the second test, you can apply the operation x=2 , l=2 , r=3 , and the array becomes [1, 1, -1, -1, 1, -1, 1] , then apply the operation x=2 , l=3 , r=4 , and the array becomes [1, 1, 1, 1, 1, -1, 1] . There is no way to achieve a sum bigger than 5 . "...