Whoever tries to solve this problem will either achieve great honor or face terrible failure!
You are given three integers $$$n$$$, $$$x$$$, and $$$y$$$, along with two arrays $$$a$$$ and $$$b$$$, each of length $$$n$$$.
You need to process $$$n$$$ turns. During the $$$i$$$-th turn, you must perform exactly one of the following actions:
Your initial score is $$$0$$$. Determine the maximum score you can achieve after completing all $$$n$$$ turns.
Each test contains multiple test cases. The first line contains the number of test cases $$$T$$$ ($$$1 \leq T \leq 10^3$$$). The description of the test cases follows.
The first line of each test case contains three integers $$$n$$$, $$$x$$$, and $$$y$$$ ($$$1 \leq n, x, y \leq 2*10^3$$$).
The second line of each test case contains $$$n$$$ integers $$$a_1, a_2, \ldots, a_n$$$ ($$$1 \leq a_i \leq 2$$$), representing the array $$$a$$$.
The third line of each test case contains $$$n$$$ integers $$$b_1, b_2, \ldots, b_n$$$ ($$$1 \leq b_i \leq 10^6$$$), representing the array $$$b$$$.
It is guaranteed that the sum of $$$n^2$$$ across all test cases does not exceed $$$4 \cdot 10^6$$$.
For each test case, output in a single line the maximum score you can get.
35 1 11 1 1 1 15 4 3 2 14 1 41 2 2 22 2 2 44 2 12 1 2 19 9 1 5
24 100 114
In the first test case, you can achieve a score of $$$24$$$ as follows:
It can be proven that $$$24$$$ is the maximum score you can achieve.
In the second test case, you can achieve a score of $$$100$$$ as follows:
| Name |
|---|


