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<=10^{5}

1<=A[i],B[i]<=10^{5}

**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

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.

sabka_din_aayega | 317 |

maggiiiii | 248 |

thanuvinu94 | 211 |

Savage_19 | 206 |

Anugrah_kumar | 172 |

Bishnu Dev Panda | 803 |

sabka_din_aayega | 628 |

Anugrah_kumar | 562 |

okayboss | 561 |

maggiiiii | 531 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4925 |

Quandray | 4547 |

Login to report an issue on this page.