**Compilation/Execution Result:**

You are given two arrays of numbers. You have to maximize the first array by using the elements from the second array such that the new array formed contains unique elements. For example, let the size of array be 'n'. Then the output should be n greatest but unique elements of both the arrays. The order of elements should be as explained in example below, i.e., giving the second array priority.

**Input:**

The first line of each input contains the number of test cases . The description of T test cases follows:

The first line of each test case contains the size of the array (This is going to be the size of both the arrays).

The second line of each test case contains the elements of the first array.

The final line of each test case contains the elements of the second array.

**Output:**

Print the maximum elements giving second array higher priority. The order of appearance of elements is kept same in output as in input (See Example for better Understanding).

**Constraints:**

1 <= T <= 20

1 <= N <= 10

0 <= Array 1 [i] < =9

0 <= Array 2 [i] < =9

**Example:**

**Input:**

2

5

7 4 8 0 1

9 7 2 3 6

4

6 7 5 3

5 6 2 9

**Output:**

9 7 6 4 8

5 6 9 7

sj5331 | 87 |

iharshitmittal | 86 |

dauntless | 84 |

rksingh | 74 |

SANJAY5797 | 73 |

Shashank_Pathak | 640 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 381 |

rksingh | 358 |

akhayrutdinov | 4160 |

sanjay05 | 3611 |

Quandray | 2832 |

Ibrahim Nash | 2501 |

Michael Riegger | 2296 |