action you can go one situation to the left or to the right. Assuming there is a crate toward your turn, you push the case to the following situation toward that path. Assuming the following position is taken by another crate, that container is additionally pushed to the following position, etc. You can't go through the crates. You can't pull the crates towards you. You are permitted to play out
Correct answer will be upvoted else downvoted. Computer science.
one action you can go one situation to the left or to the right. Assuming there is a crate toward your turn, you push the case to the following situation toward that path. Assuming the following position is taken by another crate, that container is additionally pushed to the following position, etc. You can't go through the crates. You can't pull the crates towards you.
You are permitted to play out quite a few actions (perhaps, zero). You will likely place whatever number boxes on unique situations as could be expected under the circumstances. Note that some cases can be at first positioned on unique positions.
Input
The principal line contains a solitary integer t (1≤t≤1000) — the number of testcases.
Then, at that point, portrayals of t testcases follow.
The principal line of each testcase contains two integers n and m (1≤n,m≤2⋅105) — the number of boxes and the number of extraordinary positions, individually.
The second line of each testcase contains n particular integers in the expanding request a1,a2,… ,an (−109≤a1<a2<⋯<an≤109;
The third line of each testcase contains m particular integers in the expanding request b1,b2,… ,bm (−109≤b1<b2<⋯<bm≤109; bi≠0) — the exceptional positions.
The amount of n over all testcases doesn't surpass 2⋅105. The amount of m over all testcases doesn't surpass 2⋅105.
Output
For each testcase print a solitary integer — the most extreme number of boxes that can be set on extraordinary positions.
Step by step
Solved in 4 steps with 1 images
