Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 1.0 Seconds Memory Limit: 65536K

Total Runs: 2143 Accepted Runs: 1427

WCM is a student of UESTC major in Math. He says he is the best Math student of UESTC. ZHC laughs hearing that, so he gives WCM a simple problem to solve. The problem is very simple. Given two sequences of integers (*A*_{1}, A_{2},...,A_{n}) and (*B*_{1}, B_{2}, ..., B_{m}), you are to find how many pairs of integers (*i*, *j*) satisfying *A*_{i} + *B*_{j} = 0.### Input

The first line of the input gives an integer *t* (*t* < 100), which is the number of test case.### Output

### Sample Input

### Sample Output

What an easy problem! But WCM works for three days and can't solve it. Now he returns to you for help. If you solve it, he will think you the best Math student of UESTC.

For each test case, there are 4 lines. The first line gives the length of the first sequence *n* (0 < *n* ≤ 200), followed by a line containing *n* integers *A _{1}, A_{2},...,A_{n}* separated by single space. The third and fourth lines describe the second sequence (

Every number in two sequences will be in the range of [-10000, 10000].

For each test case, output a line containing the answer.

2 2 1 2 3 -1 -2 -3 1 -1 2 2 1

2 1

Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz