Rikka with Time Complexity

Problem Description

Input

The first line contains a single number $t(1 \leq t \leq 10^5)$, the number of testcases. For each testcase, the first line contains two integers $a,b(1 \leq a,b \leq 3)$, the length of $A$ and $B$. The second line contains $a$ integers $A_i$ and the third line contains $b$ integers $B_i(1 \leq A_i,B_i \leq 10^9)$, which describe $A$ and $B$.

Output

For each testcase, output a single line with a single integer, the answer.

Sample Input

3

1 1

1

2

2 2

1 2

2 1

1 3

1

1000000000 3 3

Sample Output

1

-1

-1

Source

2018 Multi-University Training Contest 9