03 - General Computing knowledge aptitude (Theory)

If a = 2
and a = b
then a + b = ?

if a = 3
and b < a
and c > b
then c must be greater than 3. 

A new base 2 language uses only two symbols

X and
Y

Consider the following and answer the question: 
XX = 0
XY = 1
YX = 2
What is 3 in this base 2 language of XY?

Note: Link for information about the Poisson distribution http://en.wikipedia.org/wiki/Poisson_distribution#Definition

There are two parallel roads, each containing N and M buckets, respectively. Each bucket may contain some balls. 
The buckets on both roads are kept in such a way that they are sorted according to the number of balls in them. 
Mr Moose starts from the end of the road which has the bucket with a lower number of balls(i.e. if 
buckets are sorted in increasing order, then geek will start from the left side of the road).
The geek can change the road only at the point of intersection(which means, buckets with the same 
number of balls on two roads). Now you need to help Mr Moose to collect the maximum number of balls.

Input:
The first line of input contains T denoting the number of test cases. 
The first line of each test case contains two integers N and M, denoting 
the number of buckets on road1 and road2 respectively. 2nd line of each 
test case contains N integers, number of balls in buckets on the first road. 
3rd line of each test case contains M integers, number of balls in buckets 
on the second road.

Output:
For each test case output a single line containing the maximum possible balls that Mr Moose can collect.

Constraints:
1<= T <= 1000
1<= N <= 10^3
1<= M <=10^3
0<= A[i],B[i]<=10^6

Example:
Input:
1
5 5
1 4 5 6 8
2 3 4 6 9

What is the output?