Given two linked lists, find the node at which they intersect.

Here the linked lists A and B intersect at C1.

If the two lists do not intersect, return null.

Testing

Input Format

The first line contains ‘T’ denoting the number of independent test cases.

For each test case, the input has five lines:

• Two space-separated integers L₁ and L₂ denoting the size of the lists A and B before they intersect.
• L₁ space-separated integers denoting the node values for the first L₁ nodes of A.
• L₂ space-separated integers denoting the node values for the first L₂ nodes of B.
• An integer L₃ denoting the length of the list after A and B intersect.
• L₃ space-separated integers denoting the node values for the common nodes of A and B.

Output Format

For each test case, a line with the value of the node where A and B intersect. If they do not intersect, output -1.

Sample Input

3
3 3
4 5 6
7 8 9
3
1 2 3
0 4

4 5 6 7
2
8 9
2 3
1 2
3 4 5
0

Expected Output

1
8
-1

Constraints

1 <= T <= 10
0 <= L₁, L₂, L₃ <= 10⁴
1 <= nodeValue < = 10⁵