#P1770A. Koxia and Whiteboards

Koxia and Whiteboards

Description

Kiyora has nn whiteboards numbered from 11 to nn. Initially, the ii-th whiteboard has the integer aia_i written on it.

Koxia performs mm operations. The jj-th operation is to choose one of the whiteboards and change the integer written on it to bjb_j.

Find the maximum possible sum of integers written on the whiteboards after performing all mm operations.

Each test consists of multiple test cases. The first line contains a single integer tt (1t10001 \leq t \leq 1000) — the number of test cases. The description of test cases follows.

The first line of each test case contains two integers nn and mm (1n,m1001 \le n,m \le 100).

The second line of each test case contains nn integers a1,a2,,ana_1, a_2, \ldots, a_n (1ai1091 \le a_i \le 10^9).

The third line of each test case contains mm integers b1,b2,,bmb_1, b_2, \ldots, b_m (1bi1091 \le b_i \le 10^9).

For each test case, output a single integer — the maximum possible sum of integers written on whiteboards after performing all mm operations.

Input

Each test consists of multiple test cases. The first line contains a single integer tt (1t10001 \leq t \leq 1000) — the number of test cases. The description of test cases follows.

The first line of each test case contains two integers nn and mm (1n,m1001 \le n,m \le 100).

The second line of each test case contains nn integers a1,a2,,ana_1, a_2, \ldots, a_n (1ai1091 \le a_i \le 10^9).

The third line of each test case contains mm integers b1,b2,,bmb_1, b_2, \ldots, b_m (1bi1091 \le b_i \le 10^9).

Output

For each test case, output a single integer — the maximum possible sum of integers written on whiteboards after performing all mm operations.

Sample Input 1

4
3 2
1 2 3
4 5
2 3
1 2
3 4 5
1 1
100
1
5 3
1 1 1 1 1
1000000000 1000000000 1000000000

Sample Output 1

12
9
1
3000000002

Note

In the first test case, Koxia can perform the operations as follows:

  1. Choose the 11-st whiteboard and rewrite the integer written on it to b1=4b_1=4.
  2. Choose the 22-nd whiteboard and rewrite to b2=5b_2=5.

After performing all operations, the numbers on the three whiteboards are 44, 55 and 33 respectively, and their sum is 1212. It can be proven that this is the maximum possible sum achievable.

In the second test case, Koxia can perform the operations as follows:

  1. Choose the 22-nd whiteboard and rewrite to b1=3b_1=3.
  2. Choose the 11-st whiteboard and rewrite to b2=4b_2=4.
  3. Choose the 22-nd whiteboard and rewrite to b3=5b_3=5.

The sum is 4+5=94 + 5 = 9. It can be proven that this is the maximum possible sum achievable.