Qwqkawaii is registering for (n) ((n\le 50)) courses. In the registration system, he can submit a course wish for each course, which indicates his priority for taking that course. Course wishes are divided into (k+1) ((k\le 20)) priority levels, where level (1) is the highest priority and level (k+1) is the lowest. The first (k) wish levels have capacity limits: for each (1 \le i \le k), at most (a_i) courses can be assigned wish level (i). Note that wish level (k+1) has no capacity limit. Initially, the (i)-th course has wish level (b_i), and it is guaranteed that this initial assignment satisfies all capacity limits. Now qwqkawaii wants to adjust all his courses to wish level (k + 1). To achieve this, he can apply the following operation at most (1000) times: Select a course (i) ((1\le i\le n)), then increase (b_i) by (1). Note that: A course at level (k+1) cannot be selected; After every single operation, all capacity limits must still be satisfied. Your task is to construct a valid adjustment sequence with at most (1000) operations, or report that it is impossible. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 50)). The description of the test cases follows. The first line of each test case contains two integers (n) and (k) ((1 \le n \le 50), (1 \le k \le 20)) — the number of courses and the number of priority levels (excluding the lowest priority level). The second line contains (k) integers (a_1, a_2, \ldots, a_k) ((1 \le a_i \le n)) — the capacity limits of the first (k) wish levels. The third line contains (n) integers (b_1, b_2, \ldots, b_n) ((1 \le b_i \le k+1)) — the initial wish levels of the courses. It is guaranteed that the initial assignment satisfies all capacity limits. For each test case, if it is impossible to reach the target state, print a s