Box Factory (Small)

You run a factory with two assembly lines. The first line makes boxes, and the second line makes the toys that go into those boxes. Each box type takes exactly one toy type, and each toy type fits exactly one box type.

At the start you pick up a box from the first line and a toy from the second line. While you hold one box and one toy, you can do one of the following.

• Throw away the box you hold and pick up the next box.
• Throw away the toy you hold and pick up the next toy.
• If the box and the toy have the same type, put the toy in the box and send it out to a customer.

You pick up boxes in the order they were made, and you pick up toys in the order they were made. Given the production order of both lines, find the largest number of boxed toys you can send out.

The two lines make a great many boxes and toys. Each line keeps making one type for a long stretch before it switches to another type, so the production order is given as runs of one type.

The first line contains the number of test cases $T$. Each test case takes three lines.

The first line contains two integers $N$ and $M$. The second line contains $2N$ integers $a_1$, $A_1$, $a_2$, $A_2$, ..., $a_N$, $A_N$. The third line contains $2M$ integers $b_1$, $B_1$, $b_2$, $B_2$, ..., $b_M$, $B_M$.

The first line makes $a_1$ boxes of type $A_1$, then $a_2$ boxes of type $A_2$, and finally $a_N$ boxes of type $A_N$. In the same way, the second line makes $b_1$ toys of type $B_1$ through $b_M$ toys of type $B_M$. A toy goes into a box if and only if their type numbers are equal.

Two neighboring runs can have the same type number.

Limits

• $1 \le T \le 100$
• $1 \le N \le 3$
• $1 \le M \le 100$
• $1 \le a_i, b_i \le 10^{16}$
• $1 \le A_i, B_i \le 100$

For each test case, print one line in the form "Case #x: y", where $x$ is the test case number starting from 1 and $y$ is the largest number of boxed toys you can send out.