After learning about the Artistic Balance Tree, Lizhous encountered the following problem. You are given an array (a) consisting of (n) integers. You need to perform exactly (m) operations on (a) in order. Each operation consists of two steps. Specifically, in the (i)-th operation, you are given an integer (x_i), and you will: First, select a center index (u) and a non-negative length (y) such that the interval (u-y, u+y) lies entirely within (1, n) (i.e., (u - y \ge 1) and (u + y \le n)). For each (1\le i\le y), swap the elements (a_{u-i}) and (a_{u+i}). Then, mark the element at index (x_i). If this element is already marked, nothing happens. Note that the marks are on elements, not indices. That means if an element is swapped with some other element by future operations, the mark will stay on it. After performing all (m) operations, your task is to find the minimum possible sum of all elements that remain unmarked . Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains two integers (n) and (m) ((1 \le n, m \le 10^5)) — the length of (a) and the number of operations. The second line contains (n) integers (a_1, a_2, \ldots, a_n) ((-10^9 \le a_i \le 10^9)) — the elements of (a). The third line contains (m) integers (x_1, x_2, \ldots, x_m) ((1 \le x_i \le n)) — the indices to be marked in each operation. It is guaranteed that the sum of (n) over all test cases does not exceed (10^5). It is guaranteed that the sum of (m) over all test cases does not exceed (10^5). For each test case, output a single integer — the minimum possible sum of the unmarked elements after all operations. In the first test case, one optimal operation sequence is as follows: Choose center (u=4) and l