Iranian Community of Prize Crafting

Time Limit: 2 Seconds    Memory Limit: 65536 KB

Iranian Community of Prize Crafting (ICPC) decided to provide some snacks and prizes for the most secure laboratories across the country. They prepared a list of n items (hereafter, called item list) they need! One of the ICPC members went to a great marketing store and bought m item(s). Some of these items might not be in the item list.

Write a program which calculates which items from the item list are still needed.


The input contains several test cases.

In the first line of input comes T (0 < T ≤ 128), the number of test cases.

Each test case begins with two space-separated numbers n and m. The next two rows of the input contain n and m space-separated integers respectively. Each of these integers represents the code of each item. m and n are not greater than 1000 and the code of items are also lower than a billion.

To simplify, we only need one sample for each item. Therefore, the item codes in each row are unique.


For each test case, you should print a line containing a sorted list of items (ascending order) that are still needed. The numbers should be separated by ”,”.

Sample Input

3 2
1 6 2
2 5

Sample Output


Source: 13th Iran Nationwide Internet Contest - UT