B"Monocarp and Bicarp are playing a card game. Each card has two parameters: an attack value and a defence value. A card s beats another card t if the attack of s is strictly greater than the defence of t . Monocarp has n cards, the i -th of them has an attack value of mathit{ax}_i and a defence value of mathit{ay}_i . Bicarp has m cards, the j -th of them has an attack value of mathit{bx}_j and a defence value of mathit{by}_j . On the first move, Monocarp chooses one of his cards and plays it. Bicarp has to respond with his own card that beats that card. After that, Monocarp has to respond with a card that beats Bicarp's card. After that, it's Bicarp's turn, and so forth. After a card is beaten, it returns to the hand of the player who played it. It implies that each player always has the same set of cards to play as at the start of the game. The game ends when the current player has no cards that beat the card which their opponent just played, and the current player loses. If the game lasts for 100^{500} moves, it's declared a draw. Both Monocarp and Bicarp play optimally. That is, if a player has a winning strategy regardless of his opponent's moves, he plays for a win. Otherwise, if he has a drawing strategy, he plays for a draw. You are asked to calculate three values: The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The first line of each test case contains an integer n ( 1 <= n <= 3 cdot 10^5 ) -- the number of cards Monocarp has. The second line contains n integers mathit{ax}_1, mathit{ax}_2, ... , mathit{ax}_n ( 1 <= mathit{ax}_i <= 10^6 ) -- the attack values of Monocarp's cards. The third line contains n integers mathit{ay}_1, mathit{ay}_2, ... , mathit{ay}_n ( 1 <= mathit{ay}_i <= 10^6 ) -- the defence values of Monocarp's cards. The fourth line conta"...