A16331 | Infinite Card Game

The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases.

The first line of each test case contains an integer $n$ ( $1 \le n \le 3 \cdot 10^5$ ) — the number of cards Monocarp has.

The second line contains $n$ integers $\mathit{ax}_1, \mathit{ax}_2, \dots, \mathit{ax}_n$ ( $1 \le \mathit{ax}_i \le 10^6$ ) — the attack values of Monocarp's cards.

The third line contains $n$ integers $\mathit{ay}_1, \mathit{ay}_2, \dots, \mathit{ay}_n$ ( $1 \le \mathit{ay}_i \le 10^6$ ) — the defence values of Monocarp's cards.

The fourth line contains a single integer $m$ ( $1 \le m \le 3 \cdot 10^5$ ) — the number of cards Bicarp has.

The fifth line contains $m$ integers $\mathit{bx}_1, \mathit{bx}_2, \dots, \mathit{bx}_m$ ( $1 \le \mathit{bx}_j \le 10^6$ ) — the attack values of Bicarp's cards.

The sixth line contains $m$ integers $\mathit{by}_1, \mathit{by}_2, \dots, \mathit{by}_m$ ( $1 \le \mathit{by}_j \le 10^6$ ) — the defence values of Bicarp's cards.

Additional constraints on the input: the sum of $n$ over all test cases doesn't exceed $3 \cdot 10^5$ , the sum of $m$ over all test cases doesn't exceed $3 \cdot 10^5$ .

For each test case, print three integers:

- the number of Monocarp's starting moves that result in a win for Monocarp;
- the number of Monocarp's starting moves that result in a draw;
- the number of Monocarp's starting moves that result in a win for Bicarp.

无