CF1874A.Jellyfish and Game

Jellyfish has $n$ green apples with values $a_1, a_2, \dots, a_n$ and Gellyfish has $m$ green apples with values $b_1,b_2,\ldots,b_m$.

They will play a game with $k$ rounds. For $i=1,2,\ldots,k$ in this order, they will perform the following actions:

• If $i$ is odd, Jellyfish can choose to swap one of her apples with one of Gellyfish's apples or do nothing.
• If $i$ is even, Gellyfish can choose to swap one of his apples with one of Jellyfish's apples or do nothing.

Both players want to maximize the sum of the values of their apples.

Since you are one of the smartest people in the world, Jellyfish wants you to tell her the final sum of the value of her apples after all $k$ rounds of the game. Assume that both Jellyfish and Gellyfish play optimally to maximize the sum of values of their apples.

水母有 $n$ 个绿色苹果，其价值分别为 $a_1, a_2, \dots, a_n$；果冻水母有 $m$ 个绿色苹果，其价值分别为 $b_1,b_2,\ldots,b_m$。

他们将进行 $k$ 轮游戏。对于 $i=1,2,\ldots,k$（按此顺序），他们依次执行以下操作：

• 若 $i$ 为奇数，水母可选择将其一个苹果与果冻水母的一个苹果交换，或选择不进行任何操作；
• 若 $i$ 为偶数，果冻水母可选择将其一个苹果与水母的一个苹果交换，或选择不进行任何操作。

双方玩家均希望最大化自己所持苹果的价值总和。

由于你是世界上最聪明的人之一，水母希望你告诉她：在全部 $k$ 轮游戏结束后，她所持苹果的价值总和是多少？假设水母与果冻水母均以最优策略进行游戏，即始终以最大化各自苹果价值总和为目标。

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \leq t \leq 2000$). The description of the test cases follows.

The first line of each test case contains three integers, $n$, $m$ and $k$ ($1 \leq n, m \leq 50$, $1 \leq k \leq 10^9$) — the number of green apples Jellyfish has, the number of green apples Gellyfish has and the number of rounds of the game respectively.

The second line of each test case contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \leq a_i \leq 10^9$) — the values of Jellyfish's green apples.

The third line of each test case contains $m$ integers $b_1, b_2, \dots, b_m$ ($1 \leq b_i \leq 10^9$) — the values of Gellyfish's green apples.

Do note that the sum of $n$ and $m$ over all test cases are both not bounded.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \leq t \leq 2000$）。随后是各测试用例的描述。

每个测试用例的第一行包含三个整数 $n$、$m$ 和 $k$（$1 \leq n, m \leq 50$，$1 \leq k \leq 10^9$）——分别表示 Jellyfish 拥有的青苹果数量、Gellyfish 拥有的青苹果数量以及游戏的轮数。

每个测试用例的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \leq a_i \leq 10^9$）——表示 Jellyfish 的青苹果的价值。

每个测试用例的第三行包含 $m$ 个整数 $b_1, b_2, \dots, b_m$（$1 \leq b_i \leq 10^9$）——表示 Gellyfish 的青苹果的价值。

请注意：所有测试用例中 $n$ 的总和与 $m$ 的总和均无上界。

For each test case, output a single integer — the final sum of the values of Jellyfish's apples.

对于每个测试用例，输出一个整数——即水母（Jellyfish）的苹果的价值之和。

In the first test case, Jellyfish will swap the apple of value $1$ and $4$.

In the second test case, both players will swap the two apples $10,000$ times.

In the fourth test case, Jellyfish will do nothing.

在第一个测试用例中，水母将交换价值为 $1$ 和 $4$ 的苹果。

在第二个测试用例中，两名玩家都将交换两个苹果 $10{,}000$ 次。

在第四个测试用例中，水母将不执行任何操作。