Cancel the Trains

Gildong's town has a train system with $100$ trains that travel from the bottom end to the top end and $100$ trains that travel from the left end to the right end. The trains starting from each side are numbered from $1$ to $100$, and all trains have the same speed. Look at the picture below.

The train system can be represented as coordinates on a 2D plane. The $i$-th train starting at the bottom end is initially at $(i,0)$ and will be at $(i,T)$ after $T$ minutes. The $i$-th train starting at the left end is initially at $(0,i)$ and will be at $(T,i)$ after $T$ minutes. All trains arrive at their destinations after $101$ minutes.

Gildong found that some trains scheduled to depart at the same time are very dangerous. At this time, $n$ trains are scheduled to depart from the bottom end and $m$ trains from the left end. If two trains are both at $(x,y)$ at the same time for some $x$ and $y$, they crash. Find the minimum number of trains that must be cancelled to prevent all crashes.

The first line contains the number of test cases $t$ ($1\le t\le 100$).

Each test case has three lines. The first line contains two integers $n$ and $m$ ($1\le n,m\le 100$), the number of trains departing from the bottom end and the left end. The second line contains $n$ integers, the train numbers departing from the bottom end. The third line contains $m$ integers, the train numbers departing from the left end. Each number is between $1$ and $100$, inclusive, and the numbers are given in strictly increasing order.

For each test case, print one integer: the minimum number of trains to cancel to prevent all crashes.

In the first case, no crash occurs if the current schedule is followed, so the answer is zero.

In the second case, a crash occurs at $T=4$, as shown in the picture below. Cancelling one of these trains leaves the remaining trains with no crashes, so the answer is one.