Remove minimum number of elements
##### Submissions: 1345   Accuracy: 18.36%   Difficulty: Easy   Marks: 2

Given two arrays A[] and B[] consisting of N and M elements respectively. The task is to find minimum number of elements to remove from each array such that no common element exist in both the arrays.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of three lines. First line of each test case contains two integers N and M denoting size of the arrays A[] and B[] respectively. Second line contains N space separated elements of array A[] and third
line contains M space separated elements of array B[].

Output:
For each test case, print the minimum number of elements in new line.

Constraints:
1<=T<=100
1<=N,M<=105
1<=A[i],B[i]<=105

Example:
Input:

2
5 4
2 3 4 5 8

1 2 3 4
3 3
1 2 3
3 4 5

Output:
3
1

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Arun Tyagi
Author: arun03

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.